Bipartite graphs whose squares are not chromatic-choosable

zbMath1308.05050arXiv1405.1484MaRDI QIDQ2260619

Boram Park, Seog-Jin Kim

Publication date: 11 March 2015

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

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

zbMATH Keywords

list chromatic numbersquare of graphchromatic-choosable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Towards a version of Ohba's conjecture for improper colorings

Cites Work

• Unnamed Item
• Unnamed Item
• A note on list-coloring powers of graphs
• Chromatic-choosability of the power of graphs
• List edge and list total colourings of multigraphs
• On the choosability of complete multipartite graphs with part size three
• List coloring of complete multipartite graphs
• Choice Numbers of Graphs: a Probabilistic Approach
• Counterexamples to the List Square Coloring Conjecture
• Choosability conjectures and multicircuits

This page was built for publication: Bipartite graphs whose squares are not chromatic-choosable