The following pages link to A Proof of a Conjecture of Ohba (Q5251204):
Displaying 21 items.
- 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)
- 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)
- Partial list colouring of certain graphs (Q888600) (← links)
- Choice numbers of multi-bridge graphs (Q1650388) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← 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)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)
- Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices (Q6084712) (← links)
