On odd colorings of sparse graphs

DOI10.1016/j.dam.2023.11.039arXiv2212.06563OpenAlexW4389469342MaRDI QIDQ6145820

Tao Wang, Xiaojing Yang

Publication date: 9 January 2024

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

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

zbMATH Keywords

planar graphssparse graphsodd coloringproper conflict-free coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Remarks on proper conflict-free colorings of graphs
• Colorings with neighborhood parity condition
• The odd chromatic number of a planar graph is at most 8
• Odd coloring of sparse graphs and planar graphs
• A note on odd colorings of 1-planar graphs
• 1-planar graphs are odd 13-colorable
• An improvement of the bound on the odd chromatic number of 1-planar graphs

This page was built for publication: On odd colorings of sparse graphs