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
List colorings of multipartite hypergraphs, Separation Choosability and Dense Bipartite Induced Subgraphs, Improper Choosability and Property B, The interactive sum choice number of graphs, The interactive sum choice number of graphs, Graph and hypergraph colouring via nibble methods: a survey, 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 the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs, Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8, Asymmetric list sizes in bipartite graphs, DP-3-coloring of some planar graphs, On generalized choice and coloring numbers, A sufficient condition for DP-4-colorability, A note on the DP-chromatic number of complete bipartite graphs, Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable, Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable, Answers to two questions on the DP color function, Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable, DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles, The choice number versus the chromatic number for graphs embeddable on orientable surfaces, On the subspace choosability in graphs, On the chromatic polynomial and counting DP-colorings of graphs, DP-4-colorability of planar graphs without adjacent cycles of given length, Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable, 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, Proportional choosability of complete bipartite graphs, 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
