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

DOI10.7151/DMGT.2211MaRDI QIDQ2227116zbMATH OpenOpenAlexWikidataFDO

Authors Trung Duy Doan, Ingo Schiermeyer

Publication date 10 February 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

conflict-free vertex-connection numbersize of a graphvertex-colouring

Mathematics Subject Classification ID

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

Recommendations

• The conflict-free vertex-connection number and degree conditions of graphs
• Conflict-free vertex-connections of graphs
• Maximum value of conflict-free vertex-connection number of graphs
• Conflict-free (vertex-)connection numbers of graphs with small diameters
• Conflict-free connection number and size of graphs

Cites work

• Conflict-free connections of graphs
• Conflict-free vertex-connections of graphs
• Graphs with conflict-free connection number two
• Graphs with rainbow connection number two
• Maximum value of conflict-free vertex-connection number of graphs
• Note on vertex and total proper connection numbers
• On (strong) proper vertex-connection of graphs
• On proper-path colorings in graphs
• On the rainbow vertex-connection
• Proper connection and size of graphs
• Proper connection of graphs
• Rainbow connection in graphs
• The complexity of determining the rainbow vertex-connection of a graph
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The strong rainbow vertex-connection of graphs
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs

Cited in

(10)

• Conflict-free connection number and size of graphs
• Conflict-free connection number of random graphs
• Strong conflict-free connection of graphs
• The conflict-free vertex-connection number and degree conditions of graphs
• Maximum value of conflict-free vertex-connection number of graphs
• Conflict-free (vertex-)connection numbers of graphs with small diameters
• A survey on conflict-free connection coloring of graphs
• The parameterized complexity of strong conflict-free vertex-connection colorability
• The complexity of strong conflict-free vertex-connection k-colorability
• On \(\mathcal{P}\) vertex-connections of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227116)