The following pages link to (Q4379734):
Displaying 16 items.
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← 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)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- (Q2741457) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- Extremal decompositions for Nordhaus-Gaddum theorems (Q6046167) (← links)
