On chromatic‐choosable graphs
From MaRDI portal
Publication:4539876
Recommendations
Cites work
Cited in
(38)- Chromatic-choosability of the power of graphs
- Application of polynomial method to on-line list colouring of graphs
- Minimal paths and cycles in set systems
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- scientific article; zbMATH DE number 1123764 (Why is no real title available?)
- Towards an on-line version of Ohba's conjecture
- Ohba's conjecture for graphs with independence number five
- Towards a version of Ohba's conjecture for improper colorings
- A generalization of Noel-Reed-Wu theorem to signed graphs
- Critically paintable, choosable or colorable graphs
- An algebraic criterion for the choosability of graphs
- Ohba's conjecture is true for graphs with independence number at most three
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
- On the choosability of some graphs
- Partial list colouring of certain graphs
- Chromatic-choosability of hypergraphs with high chromatic number
- Total equitable list coloring
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$
- DP-colorings of graphs with high chromatic number
- On the chromatic number of the preferential attachment graph
- Choice numbers of multi-bridge graphs
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Proportional choosability: a new list analogue of equitable coloring
- scientific article; zbMATH DE number 3245178 (Why is no real title available?)
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
- List coloring a Cartesian product with a complete bipartite factor
- On-line choice number of complete multipartite graphs: an algorithmic approach
- A weaker version of a conjecture on list vertex arboricity of graphs
- On improperly chromatic-choosable graphs
- On the adaptable chromatic number of graphs
- Interview with Douglas West
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
- List point arboricity of dense graphs
- A proof of a conjecture of Ohba
- Choosability of powers of circuits
This page was built for publication: On chromatic‐choosable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539876)
