Pages that link to "Item:Q998482"

The following pages link to 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):

Displaying 10 items.

• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
• Ohba's conjecture for graphs with independence number five (Q536225) (← links)
• Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
• Choice number of some complete multi-partite graphs (Q1349076) (← links)
• On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381) (← links)
• On the choosability of some graphs (Q2799864) (← links)
• Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs. (Q2804793) (← links)
• On choosability of complete multipartite graphs K_{4,3*t,2*(k-2t-2),1*(t+1)} (Q3059092) (← links)
• (Q5143810) (← links)
• Multiple list coloring of 3‐choice critical graphs (Q6134649) (← links)