Recommendations
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- A Hajós-like theorem for list coloring
- An analogue of Hajós' theorem for the circular chromatic number
- An analogue of Hajós' theorem for the circular chromatic number. II
- Hajós theorem for colorings of edge-weighted graphs
- The graph constructions ofHaj�s and Ore
Cited in
(9)- Hajós and Ore constructions for digraphs
- Asymptotically the list colouring constants are 1
- Hajós-type constructions and neighborhood complexes
- Grassmann homomorphism and Hajós-type theorems
- Hajós-like theorem for group coloring
- On 3-choosable planar graphs of girth at least 4
- On the problem of Erdős and Hajnal in the case of list colorings
- Hajós' theorem for list colorings of hypergraphs
- A Hajós-like theorem for list coloring
This page was built for publication: Hajós' theorem for list coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886360)