Hajós' theorem for list coloring

DOI10.1016/j.disc.2004.07.001zbMath1050.05051DBLPjournals/dm/Kral04OpenAlexW2093295834WikidataQ57601587 ScholiaQ57601587MaRDI QIDQ1886360

Daniel Král'

Publication date: 18 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.001

zbMATH Keywords

Graph coloringList coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Hajós-Type Constructions and Neighborhood Complexes ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ HAJÓS-LIKE THEOREM FOR GROUP COLORING ⋮ Hajós and Ore constructions for digraphs ⋮ On 3-choosable planar graphs of girth at least 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analogue of Hajós' theorem for the circular chromatic number. II
• A Hajós-like theorem for list coloring
• Hajós theorem for colorings of edge-weighted graphs
• An analogue of Hajós’ Theorem for the circular chromatic number
• [https://portal.mardi4nfdi.de/wiki/Publication:4376497 The graph constructions ofHaj�s and Ore]

This page was built for publication: Hajós' theorem for list coloring