The colour theorems of Brooks and Gallai extended
From MaRDI portal
Publication:1356682
DOI10.1016/0012-365X(95)00294-7zbMath0871.05024OpenAlexW2167282783MaRDI QIDQ1356682
B. Wirth, Michael Stiebitz, Alexandr V. Kostochka
Publication date: 24 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00294-7
Related Items (28)
On DP-coloring of graphs and multigraphs ⋮ List Colorings of K5-Minor-Free Graphs With Special List Assignments ⋮ Brooks' Theorem and Beyond ⋮ List star edge-coloring of subcubic graphs ⋮ Cost colourings of hypergraphs ⋮ Partitions of hypergraphs under variable degeneracy constraints ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ On list-coloring outerplanar graphs ⋮ Generalized hypergraph coloring ⋮ Dirac's map-color theorem for choosability ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ On the number of edges in hypergraphs critical with respect to strong colourings ⋮ On the Choice Number of Packings ⋮ Degree choosable signed graphs ⋮ List precoloring extension in planar graphs ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems ⋮ Choosability of toroidal graphs without short cycles ⋮ Hard coloring problems in low degree planar bipartite graphs ⋮ Chromatic Ramsey number of acyclic hypergraphs ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ A list version of Dirac's theorem on the number of edges in colour-critical graphs ⋮ Cover and variable degeneracy ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ On list critical graphs ⋮ Colour-critical graphs with few edges ⋮ DP-degree colorable hypergraphs
Cites Work
This page was built for publication: The colour theorems of Brooks and Gallai extended
