The following pages link to On chromatic‐choosable graphs (Q4539876):
Displaying 31 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)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Partial list colouring of certain graphs (Q888600) (← 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)
- List point arboricity of dense graphs (Q1043798) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- A generalization of Noel-Reed-Wu theorem to signed graphs (Q2174577) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← 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)
- (Q2741457) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices (Q6084712) (← links)