Conflict-free coloring: graphs of bounded clique width and intersection graphs

DOI10.1007/978-3-030-79987-8_7OpenAlexW3183500635MaRDI QIDQ2115843

I. Vinod Reddy, Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram

Publication date: 22 March 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items

A tight bound for conflict-free coloring in terms of distance to cluster ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width

Cites Work

• Unnamed Item
• Complexity of conflict-free colorings of graphs
• Kneser's conjecture, chromatic number, and homotopy
• Distance-hereditary graphs
• Complement reducible graphs
• Parameterized algorithms for conflict-free colorings of graphs
• Upper bounds to the clique width of graphs
• Conflict-free coloring of string graphs
• Combinatorial bounds for conflict-free coloring on open neighborhoods
• Parameterized complexity of conflict-free graph coloring
• The Roberts characterization of proper and unit interval graphs
• Approximating clique-width and branch-width
• Conflict-Free Colourings of Graphs and Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring of Graphs
• A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
• Conflict-Free Coloring and its Applications

This page was built for publication: Conflict-free coloring: graphs of bounded clique width and intersection graphs