Pages that link to "Item:Q1356789"
From MaRDI portal
The following pages link to Choice number of 3-colorable elementary graphs (Q1356789):
Displaying 10 items.
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← 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)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- On chromatic‐choosable graphs (Q4539876) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
