Conflict-free vertex-connections of graphs

DOI10.7151/dmgt.2116zbMath1433.05125arXiv1705.07270MaRDI QIDQ2282464

Xiaoyu Zhu, Yingying Zhang, Yaping Mao, Xue Liang Li, Stanlislav Jendroľ, Hai-xing Zhao

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.07270

zbMATH Keywords

vertex-coloring; conflict-free vertex connections

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity

Related Items

Conflict-free (vertex)-connection numbers of graphs with small diameters, On conflict-free connection of graphs, Conflict-free connection number and independence number of a graph, Conflict-free connection number of random graphs, Conflict-free vertex connection number at most 3 and size of graphs, (Strong) conflict-free connectivity: algorithm and complexity, Strong conflict-free connection of graphs, The conflict-free vertex-connection number and degree conditions of graphs

Cites Work

• Unnamed Item
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• The complexity of determining the rainbow vertex-connection of a graph
• Optimal node ranking of trees
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• Rainbow connections of graphs: a survey
• Conflict-free connection of trees
• Rainbow vertex \(k\)-connection in graphs
• On the rainbow vertex-connection
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Maximum value of conflict-free vertex-connection number of graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The strong rainbow vertex-connection of graphs