Conflict-free vertex connection number at most 3 and size of graphs.

Trung Duy Doan Ingo Schiermeyer

Published in: Discuss. Math. Graph Theory (2021)

Keyphrases

computational complexity
maximum number
conflict free
directed graph
memory requirements
undirected graph
data model
probability distribution