Conflict-free connection number and size of graphs

DOI10.1007/s00373-021-02331-8zbMath1482.05101OpenAlexW3165733987MaRDI QIDQ2051890

Ingo Schiermeyer, Trung Duy Doan

Publication date: 25 November 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02331-8

zbMATH Keywords

edge-colouringsize of graphconflict-free connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Conflict-free connection number of graphs with four bridges ⋮ The conflict-free vertex-connection number and degree conditions of graphs

Cites Work

• Unnamed Item
• Improved degree conditions for Hamiltonian properties
• Proper connection of graphs
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• Graphs with conflict-free connection number two
• Rainbow connections of graphs: a survey
• Hardness results for three kinds of colored connections of graphs
• Proper connection and size of graphs
• Rainbow connection number of dense graphs
• Rainbow connection in sparse graphs
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• Maximal circuits of graphs. I
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

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