Painting squares in \(\Delta^2-1\) shades

zbMath1339.05124arXiv1311.1251MaRDI QIDQ2629492

Landon Rabern, Daniel W. Cranston

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

squarelist coloringMoore graphonline list coloringpaint number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Square Coloring Planar Graphs with Automatic Discharging ⋮ A Brooks-like result for graph powers ⋮ Brooks' theorem on powers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• The distance coloring of graphs
• Colorings and orientations of graphs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Brooks' theorem on powers of graphs
• A Fractional Analogue of Brooks' Theorem
• Graphs with $\chi=\Delta$ Have Big Cliques
• On Moore Graphs with Diameters 2 and 3
• List-coloring the square of a subcubic graph
• Maximum degree in graphs of diameter 2
• Coloring Claw-Free Graphs with $\Delta-1$ Colors

This page was built for publication: Painting squares in \(\Delta^2-1\) shades