A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs

DOI10.1002/jgt.22670zbMath1522.05094arXiv2003.05637MaRDI QIDQ6080863

Subrahmanyam Kalyanasundaram, Sriram Bhyravarapu, Rogers Mathew

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

bounded degree graphsconflict-free coloring

Mathematics Subject Classification ID

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

Related Items (2)

On odd colorings of planar graphs ⋮ A note on the conflict-free chromatic index

Cites Work

• 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 and its Applications
• Deterministic Algorithms for the Lovász Local Lemma
• Conflict-Free Colouring of Graphs

This page was built for publication: A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs