A survey on conflict-free connection coloring of graphs

DOI10.1016/J.DAM.2024.03.021WikidataQ127175078 ScholiaQ127175078MaRDI QIDQ6497946

Zhong Huang, Hong Chang

Publication date: 6 May 2024

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

zbMATH Keywords

conflict-free connection numberconflict-free vertex-connection numberstrong conflict-free connection numberconflict-free path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Conflict-free coloring of points on a line with respect to a set of intervals
• Complexity of conflict-free colorings of graphs
• Strong conflict-free coloring for intervals
• Graph unique-maximum and conflict-free colorings
• On an edge ranking problem of trees and graphs
• Edge ranking of graphs is hard
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• On conflict-free connection of graphs
• Graphs with conflict-free connection number two
• Optimal edge ranking of trees in polynomial time
• Rainbow connections of graphs: a survey
• Conflict-free connection number and independence number of a graph
• Conflict-free connection number and size of graphs
• Conflict-free connection of trees
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Remarks on proper conflict-free colorings of graphs
• Conflict-free connection number of random graphs
• Hardness results for three kinds of colored connections of graphs
• Conflict-free vertex connection number at most 3 and size of graphs
• Colorful monochromatic connectivity
• Conflict-free vertex-connections of graphs
• (Strong) conflict-free connectivity: algorithm and complexity
• Strong conflict-free connection of graphs
• Conflict-free coloring of points and simple regions in the plane
• The conflict-free vertex-connection number and degree conditions of graphs
• On Complementary Graphs
• Rainbow connection in graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Rankings of Graphs
• 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
• Online Conflict-Free Colouring for Hypergraphs
• Deterministic conflict-free coloring for intervals
• Erd\"os-Gallai-type results for conflict-free connection of graphs
• Conflict-free (vertex)-connection numbers of graphs with small diameters
• Conflict-Free Coloring and its Applications
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Conflict-Free Colouring of Graphs
• Online Conflict‐Free Coloring for Intervals
• Characterizations of derived graphs
• Optimal edge ranking of trees in linear time

This page was built for publication: A survey on conflict-free connection coloring of graphs