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

DOI10.1007/S00373-023-02617-ZMaRDI QIDQ2689111zbMATH OpenOpenAlexFDO

Authors Jan Petr, Julien Portier

Publication date 9 March 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

colouringdischarging methododd colouringplanar graph

Mathematics Subject Classification ID

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

Recommendations

• 1-planar graphs are odd 13-colorable
• A note on odd colorings of 1-planar graphs
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• Odd coloring of sparse graphs and planar graphs

Cites work

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

Cited in

(29)

• Planar graphs have two-coloring number at most 8
• Remarks on proper conflict-free colorings of graphs
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• scientific article; zbMATH DE number 7666240 (Why is no real title available?)
• 1-planar graphs are odd 13-colorable
• Odd colourings, conflict-free colourings and strong colouring numbers
• 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
• Odd-sum colorings of planar graphs
• The odd chromatic number of a planar graph is at most 8
• Improper odd coloring of IC-planar graphs
• Odd 4-coloring of outerplanar graphs
• Brooks-type theorems for relaxations of square colorings
• Odd colorings of sparse graphs
• New bounds for odd colourings of graphs
• Odd coloring of 2-boundary planar graphs and beyond
• On odd and strong odd colorings of graphs
• The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
• On the parameterized complexity of odd coloring
• On strong odd colorings of graphs
• An odd 4-coloring of a maximal outerplanar graph
• Odd coloring of k-trees
• Strong odd coloring of sparse graphs
• On the parameterized complexity of odd coloring
• On a conjecture about the strong odd chromatic number of planar graphs
• 2-odd coloring of graphs with small maximum average degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689111)