scientific article

zbMath0459.05038MaRDI QIDQ3909076

Alexandr V. Kostochka

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

theorem of Brooks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Brooks' Theorem and Beyond ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on \(\Delta\)-critical graphs ⋮ Large cliques in graphs with high chromatic number ⋮ The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree ⋮ Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Coloring hammer-free graphs with \(\Delta - 1\) colors ⋮ Partitioning of a graph into induced subgraphs not containing prescribed cliques ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ Chromatic numbers of layered graphs with a bounded maximal clique ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ A different short proof of Brooks' theorem ⋮ On hitting all maximum cliques with an independent set ⋮ Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs ⋮ A strengthening of Brooks' theorem ⋮ A note on coloring vertex-transitive graphs