Pages that link to "Item:Q2463475"

The following pages link to On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475):

Displaying 14 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)
• On-line list colouring of complete multipartite graphs (Q426807) (← links)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
• On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← 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)
• Towards an on-line version of Ohba's conjecture (Q2441619) (← 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)
• On the asymptotic value of the choice number of complete multi‐partite graphs (Q5471010) (← links)
• Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)