Counterexamples to the List Square Coloring Conjecture

DOI10.1002/jgt.21802zbMath1309.05075arXiv1305.2566OpenAlexW1947433718WikidataQ123266271 ScholiaQ123266271MaRDI QIDQ4982285

Seog-Jin Kim, Boram Park

Publication date: 24 March 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberlist chromatic numbersquare of graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ Towards an on-line version of Ohba's conjecture ⋮ Chromatic-choosability of the power of graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Total equitable list coloring ⋮ Bipartite graphs whose squares are not chromatic-choosable ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Strong list-chromatic index of subcubic graphs ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ A Proof of a Conjecture of Ohba

Cites Work

• Edge-choosability in line-perfect multigraphs
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• List coloring of complete multipartite graphs
• Choosability conjectures and multicircuits

This page was built for publication: Counterexamples to the List Square Coloring Conjecture