scientific article; zbMATH DE number 1496580
From MaRDI portal
Publication:4500691
DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200007)16:4<364::AID-RSA5>3.0.CO;2-0" /><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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ On DP-coloring of graphs and multigraphs ⋮ List Colourings of Regular Hypergraphs ⋮ DP-3-coloring of some planar graphs ⋮ Asymmetric list sizes in bipartite graphs ⋮ The asymptotic behavior of the correspondence chromatic number ⋮ On the subspace choosability in graphs ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Some new bounds on \(T_{r}\)-choosability ⋮ Proportional choosability of complete bipartite graphs ⋮ Improper Choosability and Property B ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ List Coloring with a Bounded Palette ⋮ Dense uniform hypergraphs have high list chromatic number ⋮ Unnamed Item ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ On generalized choice and coloring numbers ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Hypergraph containers ⋮ Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable ⋮ On-line list coloring of matroids ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ A sufficient condition for DP-4-colorability ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ List coloring of Cartesian products of graphs ⋮ A note on the DP-chromatic number of complete bipartite graphs ⋮ The interactive sum choice number of graphs ⋮ Answers to two questions on the DP color function ⋮ The interactive sum choice number of graphs ⋮ List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs ⋮ List colorings of multipartite hypergraphs ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ Hypergraph list coloring and Euclidean Ramsey theory ⋮ Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable ⋮ Lower bounds on coloring numbers from hardness hypotheses in pcf theory ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Circular choosability ⋮ DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
Cites Work
This page was built for publication:
