Odd colourings, conflict-free colourings and strong colouring numbers

MaRDI QIDQ6072045zbMATH OpenFDO

Authors Robert Hickingbotham

Publication date 29 November 2023

Full work available at URL https://arxiv.org/abs/2203.10402, http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p160.pdf

zbMATH Keywords

odd chromatic numberconflict-free chromatic number

Mathematics Subject Classification ID

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

Recommendations

• On odd colorings of sparse graphs
• The odd chromatic number of a planar graph is at most 8
• 1-planar graphs are odd 13-colorable
• An improvement of the bound on the odd chromatic number of 1-planar graphs
• Odd colorings of sparse graphs

Cites work

• Acyclic and oriented chromatic numbers of graphs
• Boxicity, poset dimension, and excluded minors
• Characterisations and examples of graph classes with bounded expansion
• Colorings with neighborhood parity condition
• Colouring graphs with bounded generalized colouring number
• Grad and classes with bounded expansion. I: Decompositions
• Graphs with linearly bounded Ramsey numbers
• Improper colourings inspired by Hadwiger's conjecture
• Odd coloring of sparse graphs and planar graphs
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Orderings on graphs and game coloring number
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• Radius two trees specify χ‐bounded classes
• Remarks on odd colorings of graphs
• Remarks on proper conflict-free colorings of graphs
• Sparsity. Graphs, structures, and algorithms
• Strongly sublinear separators and polynomial expansion
• Sublinear separators in intersection graphs of convex shapes
• The odd chromatic number of a planar graph is at most 8

Cited in

(5)

• On odd colorings of sparse graphs
• Relaxation of Wegner's planar graph conjecture for maximum degree 4
• Brooks-type theorems for relaxations of square colorings
• Proper conflict-free coloring of graphs with large maximum degree
• New bounds for odd colourings of graphs

This page was built for publication: Odd colourings, conflict-free colourings and strong colouring numbers

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