The following pages link to List colourings of graphs (Q2741180):
Displaying 36 items.
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
- A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Dense graphs have \(K_{3,t}\) minors (Q709308) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- List-colouring the square of a \(K_4\)-minor-free graph (Q941324) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← 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)
- A note on list improper coloring of plane graphs (Q1003695) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
- Entire choosability of near-outerplane graphs (Q1025470) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Graphic and protographic lists of integers (Q1422142) (← links)
- Partial list colorings (Q1972145) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs (Q2153396) (← links)
- List supermodular coloring (Q2419323) (← links)
- On choosability of some complete multipartite graphs and Ohba's conjecture (Q2463475) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- Sum list coloring graphs (Q2502028) (← links)
- List-colourings (Q2822593) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- (Q3110121) (← links)
- Graph colorings with local constraints -- a survey (Q4210665) (← links)
- Defective choosability of graphs with no edge-plus-independent-set minor (Q4446887) (← links)
- List coloring digraphs (Q4638642) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- Biclique immersions in graphs with independence number 2 (Q6612311) (← links)
- On the choosability of \(H\)-minor-free graphs (Q6632798) (← links)
