Odd colorings of sparse graphs

DOI10.4310/JOC.240906221852MaRDI QIDQ6641735zbMATH OpenFDO

Authors Daniel W. Cranston

Publication date 21 November 2024

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/JOC.240906221852

zbMATH Keywords

coloringmaximum average degreeodd coloringsparse graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

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

Cited in

(12)

• Odd colourings, conflict-free colourings and strong colouring numbers
• On odd colorings of sparse graphs
• Odd-sum colorings of planar graphs
• Odd 4-coloring of outerplanar graphs
• New bounds for odd colourings of graphs
• Odd coloring of 2-boundary planar graphs and beyond
• The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
• On strong odd colorings of graphs
• Tight bounds on odd chromatic number of some standard graph products
• Odd coloring of k-trees
• Strong odd coloring of sparse graphs
• 2-odd coloring of graphs with small maximum average degree

This page was built for publication: Odd colorings of sparse graphs

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