The conflict-free vertex-connection number and degree conditions of graphs

DOI10.1007/S00373-022-02567-YzbMath1497.05078OpenAlexW4295602022MaRDI QIDQ2676761

Pham Hoang Ha, Trung Duy Doan, Ingo Schiermeyer

Publication date: 28 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02567-y

zbMATH Keywords

minimum degreevertex-colouringconflict-free vertex-connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

A survey on conflict-free connection coloring of graphs

Cites Work

• Unnamed Item
• Note on vertex and total proper connection numbers
• Proper connection of graphs
• On the minimum degree and the proper connection number 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 connection number and size of graphs
• Conflict-free vertex connection number at most 3 and size of graphs
• Conflict-free vertex-connections of graphs
• Minimum degree conditions for the proper connection number of graphs
• 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

This page was built for publication: The conflict-free vertex-connection number and degree conditions of graphs