The following pages link to (Q5463486):
Displayed 10 items.
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)