Odd 4-coloring of outerplanar graphs

DOI10.1007/S00373-024-02842-0MaRDI QIDQ6632147zbMATH OpenFDO

Authors Masaki Kashima, Xuding Zhu

Publication date 4 November 2024

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

Full work available at URL https://doi.org/10.1007/S00373-024-02842-0

zbMATH Keywords

maximal outerplanar graphodd coloringouterplanar graphunavoidable set

Mathematics Subject Classification ID

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

Recommendations

• On odd colorings of planar graphs
• Odd coloring of sparse graphs and planar graphs
• A note on odd colorings of 1-planar graphs
• The odd chromatic number of a planar graph is at most 8
• Odd colorings of sparse graphs

Cites work

• 1-planar graphs are odd 13-colorable
• Colorings with neighborhood parity condition
• Odd coloring of sparse graphs and planar graphs
• On odd colorings of sparse graphs
• Remarks on odd colorings of graphs
• Remarks on proper conflict-free colorings of graphs
• The odd chromatic number of a planar graph is at most 8

Cited in

(4)

• On odd colorings of planar graphs
• Odd coloring of 2-boundary planar graphs and beyond
• An odd 4-coloring of a maximal outerplanar graph
• Odd coloring of k-trees

This page was built for publication: Odd 4-coloring of outerplanar graphs

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