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

DOI10.7151/DMGT.2211zbMath1458.05062OpenAlexW2926111868WikidataQ128156273 ScholiaQ128156273MaRDI QIDQ2227116

Trung Duy Doan, Ingo Schiermeyer

Publication date: 10 February 2021

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

Full work available at URL: https://doi.org/10.7151/dmgt.2211

zbMATH Keywords

vertex-colouringsize of a graphconflict-free vertex-connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (4)

The conflict-free vertex-connection number and degree conditions of graphs ⋮ Conflict-free (vertex)-connection numbers of graphs with small diameters ⋮ A survey on conflict-free connection coloring of graphs ⋮ Strong conflict-free connection of graphs

Cites Work

• Unnamed Item
• Note on vertex and total proper connection numbers
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• Proper connection of graphs
• The complexity of determining the rainbow vertex-connection of a graph
• Conflict-free connections of graphs
• On (strong) proper vertex-connection of graphs
• Graphs with conflict-free connection number two
• Rainbow connections of graphs: a survey
• Conflict-free vertex-connections of graphs
• Proper connection and size of graphs
• On the rainbow vertex-connection
• Graphs with rainbow connection number two
• 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
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• The strong rainbow vertex-connection of graphs

This page was built for publication: Conflict-free vertex connection number at most 3 and size of graphs