Chromatic choosability of a class of complete multipartite graphs
From MaRDI portal
Publication:5452942
Recommendations
- On choosability of complete multipartite graphs \(K_{4,3*t,2*(k-2t-2),1*(t+1)}\)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Ohba's conjecture is true for graphs with independence number at most three
Cited in
(17)- On chromatic‐choosable graphs
- On-line list colouring of complete multipartite graphs
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- Ohba's conjecture for graphs with independence number five
- Ohba's conjecture is true for graphs with independence number at most three
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
- On the choosability of some graphs
- Chromatic-choosability of hypergraphs with high chromatic number
- Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.
- Choice number of some complete multi-partite graphs
- Chromatic λ‐choosable and λ‐paintable graphs
- On choosability of complete multipartite graphs \(K_{4,3*t,2*(k-2t-2),1*(t+1)}\)
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
- On the chromaticity of complete multipartite graphs with certain edges added
- On improperly chromatic-choosable graphs
- A proof of a conjecture of Ohba
This page was built for publication: Chromatic choosability of a class of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452942)
