Conflict-free coloring bounds on open neighborhoods

DOI10.1007/s00453-022-00956-6OpenAlexW4281492744MaRDI QIDQ2161000

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Publication date: 3 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00956-6

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (4)

On odd colorings of planar graphs ⋮ The odd chromatic number of a planar graph is at most 8 ⋮ A note on the conflict-free chromatic index ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

Cites Work

• Unnamed Item
• Free choosability of outerplanar graphs
• Complexity of conflict-free colorings of graphs
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• The four-colour theorem
• Parameterized algorithms for conflict-free colorings of graphs
• Combinatorial bounds for conflict-free coloring on open neighborhoods
• Conflict-free coloring of intersection graphs of geometric objects
• Parameterized complexity of conflict-free graph coloring
• 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
• Conflict-Free Coloring of Intersection Graphs
• A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs
• Conflict-Free Coloring and its Applications
• Deterministic Algorithms for the Lovász Local Lemma
• Online Conflict‐Free Coloring for Intervals
• Parameterized Algorithms
• Conflict‐free chromatic number versus conflict‐free chromatic index

This page was built for publication: Conflict-free coloring bounds on open neighborhoods