Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
From MaRDI portal
Publication:6084712
DOI10.1002/jgt.22998zbMath1526.05055arXiv2202.09756MaRDI QIDQ6084712
Publication date: 6 November 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09756
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Choice number of some complete multi-partite graphs
- The list chromatic index of a bipartite multigraph
- On the choosability of complete multipartite graphs with part size three
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Graph colorings with local constraints -- a survey
- On chromatic‐choosable graphs
- A Proof of a Conjecture of Ohba
This page was built for publication: Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices