scientific article; zbMATH DE number 3719178

Cited in

(25)

A strengthening of Brooks' theorem
Borodin-Kostochka's conjecture on $(P_5,C_4)$-free graphs
Chromatic numbers of layered graphs with a bounded maximal clique
A note on coloring vertex-transitive graphs
A different short proof of Brooks' theorem
Graphs with $\chi=\Delta$ have big cliques
On hitting all maximum cliques with an independent set
Brooks' Theorem and Beyond
Coloring a graph with $\Delta-1$ colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
Hitting all maximum cliques with a stable set using lopsided independent transversals
A note on hitting maximum and maximal cliques with a stable set
Graph theory (algorithmic, algebraic, and metric problems)
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
Borodin-Kostochka conjecture holds for $\overline{K_{1 , 3}} $-free graphs
Borodin-Kostochka's conjecture on $\{P_2 \cup P_3, C_4\}$-free graphs
Borodin-Kostochka's conjecture on $\{P_2\cup P_3, \,\,\text{gem, banner}\}$-free graphs
On the chromatic number of $\{\text{bull, diamond}\}$-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3909076)