On conflict-free connection of graphs

DOI10.1016/j.dam.2018.08.006zbMath1405.05055OpenAlexW2891323680MaRDI QIDQ1727736

Hong Chang, Yaping Mao, Zhong Huang, Hai-xing Zhao, Xue Liang Li

Publication date: 20 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.006

zbMATH Keywords

edge-coloringconnectivityNordhaus-Gaddum-type resultconflict-free connection number

Mathematics Subject Classification ID

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

Related Items (11)

Conflict-free connection number of graphs with four bridges ⋮ Conflict-free connection number of random graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Monochromatic disconnection 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 ⋮ Strong conflict-free connection of graphs ⋮ On the \(k\)-component independence number of a tree ⋮ Conflict-free connection of trees ⋮ Some results on strong conflict-free connection number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
• Graph unique-maximum and conflict-free colorings
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• The connectivity of a graph and its complement
• A graph and its complement with specified properties. I: Connectivity
• A note on Nordhaus-Gaddum inequalities for domination.
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• Graphs with conflict-free connection number two
• Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
• Nordhaus-Gaddum inequalities for domination in graphs
• Rainbow connections of graphs: a survey
• A survey of Nordhaus-Gaddum type relations
• Conflict-free vertex-connections of graphs
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• Conflict-free coloring of points and simple regions in the plane
• On Complementary Graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• The Diameter of a Graph and its Complement
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Maximum value of conflict-free vertex-connection number of graphs
• Properly Colored Connectivity of Graphs
• Deterministic conflict-free coloring for intervals
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Online Conflict‐Free Coloring for Intervals
• Conflict-Free Colorings of Rectangles Ranges

This page was built for publication: On conflict-free connection of graphs