Pages that link to "Item:Q558319"

The following pages link to List colouring when the chromatic number is close to the order of the graph (Q558319):

Displaying 18 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)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
• A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
• Ohba's conjecture for graphs with independence number five (Q536225) (← links)
• Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
• On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
• Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
• List point arboricity of dense graphs (Q1043798) (← links)
• Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
• An algebraic criterion for the choosability of graphs (Q2345516) (← links)
• Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
• On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
• Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
• A Proof of a Conjecture of Ohba (Q5251204) (← links)
• Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)