An improvement of the bound on the odd chromatic number of 1-planar graphs

DOI10.1007/978-3-031-16081-3_33zbMath1525.05054OpenAlexW4296168488MaRDI QIDQ6111626

Bei Niu, Xin Zhang

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_33

zbMATH Keywords

discharging1-planar graphodd coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On odd colorings of sparse graphs

Cites Work

• Unnamed Item
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• Ein Sechsfarbenproblem auf der Kugel
• The odd chromatic number of a planar graph is at most 8
• Odd coloring of sparse graphs and planar graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

This page was built for publication: An improvement of the bound on the odd chromatic number of 1-planar graphs