A note on odd colorings of 1-planar graphs

DOI10.1016/j.dam.2023.01.011OpenAlexW4317597593MaRDI QIDQ2689651

Michael Lafferty, Daniel W. Cranston, Zi-Xia Song

Publication date: 13 March 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

1-planar graphproper coloringodd coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Discrete mathematics in relation to computer science (68Rxx)

Related Items (6)

1-planar graphs are odd 13-colorable ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ On odd colorings of planar graphs ⋮ On odd colorings of sparse graphs ⋮ IC-planar graphs are odd-10-colorable ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Injective colorings of sparse graphs
• A linear-time algorithm for 7-coloring 1-plane graphs
• Graphs drawn with few crossings per edge
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• The extremal function for \(K_{9}\) minors
• Homomorphiesätze für Graphen
• Contractions to k₈
• A new proof of the 6 color theorem

This page was built for publication: A note on odd colorings of 1-planar graphs