Graphs with conflict-free connection number two

DOI10.1007/s00373-018-1954-0zbMath1402.05060arXiv1707.01634OpenAlexW2963062619WikidataQ129005386 ScholiaQ129005386MaRDI QIDQ1756118

Zhong Huang, Ingo Schiermeyer, Hong Chang, Trung Duy Doan, Xue Liang Li, Stanlislav Jendroľ

Publication date: 11 January 2019

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

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

zbMATH Keywords

edge-coloringdegree conditionconflict-free connection number

Mathematics Subject Classification ID

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

Related Items (11)

Conflict-free connection number of graphs with four bridges ⋮ The conflict-free vertex-connection number and degree conditions of graphs ⋮ Conflict-free connection number of random graphs ⋮ On conflict-free connection of graphs ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ Conflict-free (vertex)-connection numbers of graphs with small diameters ⋮ Conflict-free connection number and independence number of a graph ⋮ (Strong) conflict-free connectivity: algorithm and complexity ⋮ From colourful to rainbow paths in graphs: colouring the vertices ⋮ Conflict-free connection number and size of graphs ⋮ Some results on strong conflict-free connection number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations of graphs having large proper connection numbers
• Proper connection of graphs
• Graph unique-maximum and conflict-free colorings
• Proper connection number of random graphs
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• Rainbow connections of graphs: a survey
• Proper connection and size of graphs
• Minimum degree conditions for the proper connection number of graphs
• Minimum degree condition for proper connection number 2
• Rainbow connection in graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs

This page was built for publication: Graphs with conflict-free connection number two