Odd 4-coloring of outerplanar graphs

DOI10.1007/S00373-024-02842-0MaRDI QIDQ6632147FDOQ6632147

Authors: Masaki Kashima, Xuding Zhu 

Publication date: 4 November 2024

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

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

zbMATH Keywords

outerplanar graphmaximal outerplanar graphunavoidable setodd coloring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• On odd colorings of planar graphs

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)