Choosability of \(K_5\)-minor-free graphs
From MaRDI portal
Publication:1584404
DOI10.1016/S0012-365X(98)00158-7zbMath0955.05043MaRDI QIDQ1584404
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Contractibility and the Hadwiger conjecture, A small non-\(\mathbb Z_4\)-colorable planar graph, Another proof of the 5-choosability of \(K_5\)-minor-free graphs, On group choosability of graphs. II, List Colorings of K5-Minor-Free Graphs With Special List Assignments
Cites Work