A new upper bound for the list chromatic number
From MaRDI portal
Publication:1121274
DOI10.1016/0012-365X(89)90199-4zbMath0674.05027MaRDI QIDQ1121274
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (11)
Chessboard squares ⋮ The Dinitz problem solved for rectangles ⋮ List edge and list total colourings of multigraphs ⋮ Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ List edge chromatic number of graphs with large girth ⋮ Amenable colorings ⋮ List edge colourings of some 1-factorable multigraphs ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ List \(T\)-colorings of graphs
Cites Work
This page was built for publication: A new upper bound for the list chromatic number
