Chromatic-choosability of the power of graphs
From MaRDI portal
Publication:476310
DOI10.1016/j.dam.2014.08.004zbMath1303.05064arXiv1309.0888OpenAlexW2018588622MaRDI QIDQ476310
Young Soo Kwon, Seog-Jin Kim, Boram Park
Publication date: 28 November 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0888
Related Items (4)
A note on list-coloring powers of graphs ⋮ 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
Cites Work
- Unnamed Item
- A note on list-coloring powers of graphs
- Choice number of 3-colorable elementary graphs
- List edge and list total colourings of multigraphs
- The list chromatic index of a bipartite multigraph
- On the choosability of complete multipartite graphs with part size three
- Choice Numbers of Graphs: a Probabilistic Approach
- On chromatic‐choosable graphs
- Counterexamples to the List Square Coloring Conjecture
- A Proof of a Conjecture of Ohba
- Choosability conjectures and multicircuits
This page was built for publication: Chromatic-choosability of the power of graphs
