Publication:4500691
From MaRDI portal
DOI<364::AID-RSA5>3.0.CO;2-0 10.1002/1098-2418(200007)16:4<364::AID-RSA5>3.0.CO;2-0zbMath0958.05049MaRDI QIDQ4500691
Publication date: 9 April 2001
05C15: Coloring of graphs and hypergraphs
Related Items
Improper Choosability and Property B, Online containers for hypergraphs, with applications to linear equations, Dense uniform hypergraphs have high list chromatic number, Randomly colouring graphs (a combinatorial view), Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings, Hypergraph containers, On-line list coloring of matroids, On DP-coloring of graphs and multigraphs, List coloring of Cartesian products of graphs, The asymptotic behavior of the correspondence chromatic number, Some new bounds on \(T_{r}\)-choosability, List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs, Lower bounds on coloring numbers from hardness hypotheses in pcf theory, List Colourings of Regular Hypergraphs, List Coloring with a Bounded Palette, Hypergraph list coloring and Euclidean Ramsey theory, Circular choosability
Cites Work