The colour theorems of Brooks and Gallai extended
From MaRDI portal
Publication:1356682
DOI10.1016/0012-365X(95)00294-7zbMath0871.05024MaRDI 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
Dirac's map-color theorem for choosability, On the Choice Number of Packings, Vertex partition of hypergraphs and maximum degenerate subhypergraphs, Partitions of hypergraphs under variable degeneracy constraints, Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker, 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, Chromatic Ramsey number of acyclic hypergraphs, Cost colourings of hypergraphs, Precoloring extension for 2-connected graphs with maximum degree three, On list critical graphs, Colour-critical graphs with few edges, List star edge-coloring of subcubic graphs, On the number of edges in hypergraphs critical with respect to strong colourings, Cover and variable degeneracy, Generalized hypergraph coloring, DP-degree colorable hypergraphs, On DP-coloring of graphs and multigraphs, Hard coloring problems in low degree planar bipartite graphs, Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs, List Colorings of K5-Minor-Free Graphs With Special List Assignments, Choosability of toroidal graphs without short cycles, Brooks' Theorem and Beyond, On list-coloring outerplanar graphs, A list version of Dirac's theorem on the number of edges in colour-critical graphs
Cites Work
