Pages that link to "Item:Q1023085"

The following pages link to Ohba's conjecture is true for graphs with independence number at most three (Q1023085):

Displaying 8 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)
• Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
• On the choosability of some graphs (Q2799864) (← links)
• On chromatic‐choosable graphs (Q4539876) (← links)
• A Proof of a Conjecture of Ohba (Q5251204) (← links)