A Hajós-like theorem for list coloring
From MaRDI portal
Publication:1917503
DOI10.1016/0012-365X(95)00350-6zbMath0853.05037DBLPjournals/dm/Gravier96WikidataQ56390723 ScholiaQ56390723MaRDI QIDQ1917503
Publication date: 9 December 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (9)
Coloring problems on bipartite graphs of small diameter ⋮ Hajós' theorem for list coloring ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ On \(t\)-common list-colorings ⋮ Hajós-like theorem for signed graphs ⋮ On-line choice number of complete multipartite graphs: an algorithmic approach ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ HAJÓS-LIKE THEOREM FOR GROUP COLORING ⋮ Hajós and Ore constructions for digraphs
Cites Work
This page was built for publication: A Hajós-like theorem for list coloring
