Odd coloring of sparse graphs and planar graphs

DOI10.1016/j.disc.2022.113305OpenAlexW4315784453MaRDI QIDQ2689480

Eun-Kyung Cho, Hyemin Kwon, Ilkyoo Choi, Boram Park

Publication date: 10 March 2023

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

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

zbMATH Keywords

planar graphmaximum average degreeodd 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) Vertex degrees (05C07)

Related Items (6)

1-planar graphs are odd 13-colorable ⋮ 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 ⋮ Unnamed Item ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Combinatorial bounds for conflict-free coloring on open neighborhoods
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• Conflict-Free Coloring of Graphs

This page was built for publication: Odd coloring of sparse graphs and planar graphs