Hajós' theorem for list coloring

DOI10.1016/J.DISC.2004.07.001zbMATH Open1050.05051DBLPjournals/dm/Kral04OpenAlexW2093295834WikidataQ57601587 ScholiaQ57601587MaRDI QIDQ1886360FDOQ1886360

Authors: 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

Recommendations

• A Hajós-like theorem for list coloring
• Hajós-like theorem for group coloring
• Hajós' theorem for list colorings of hypergraphs
• scientific article; zbMATH DE number 4002120
• An analogue of Hajós' theorem for the circular chromatic number. II

zbMATH Keywords

Graph coloringList coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An analogue of Hajós' theorem for the circular chromatic number
• A Hajós-like theorem for list coloring
• 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 the problem of Erdős and Hajnal in the case of list colorings
• On 3-choosable planar graphs of girth at least 4
• 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)