The odd chromatic number of a planar graph is at most 8

DOI10.1007/s00373-023-02617-zOpenAlexW4323310151MaRDI QIDQ2689111

Jan Petr, Julien Portier

Publication date: 9 March 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

colouringplanar graphdischarging methododd colouring

Mathematics Subject Classification ID

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

Related Items (6)

On odd colorings of planar graphs ⋮ An improvement of the bound on the odd chromatic number of 1-planar graphs ⋮ On odd colorings of sparse graphs ⋮ IC-planar graphs are odd-10-colorable ⋮ Unnamed Item ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Conflict-free coloring bounds on open neighborhoods
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs

This page was built for publication: The odd chromatic number of a planar graph is at most 8