Recommendations
Cites work
- scientific article; zbMATH DE number 3882454 (Why is no real title available?)
- scientific article; zbMATH DE number 1189240 (Why is no real title available?)
- scientific article; zbMATH DE number 3719178 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 1303525 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A bound on the strong chromatic index of a graph
- A bound on the total chromatic number
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Weighted sums of certain dependent random variables
Cited in
(53)- A note on coloring vertex-transitive graphs
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
- List-coloring claw-free graphs with -1 colors
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
- Fractional colorings of partial t-trees with no large clique
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs
- scientific article; zbMATH DE number 7666240 (Why is no real title available?)
- A strengthening of Brooks' Theorem for line graphs
- List colorings of k-partite k-graphs
- The chromatic number of odd-hole-free graphs
- A note on \(\Delta\)-critical graphs
- Algorithmic bounds for the chromatic number†
- The distance coloring of graphs
- Borodin-Kostochka conjecture holds for odd-hole-free graphs
- Coloring hammer-free graphs with \(\Delta - 1\) colors
- Large cliques in graphs with high chromatic number
- A reconfigurations analogue of Brooks' theorem and its consequences
- An NC algorithm for Brooks' theorem
- Convex hull of face vectors of colored complexes
- Coloring locally sparse graphs
- On graphs with linear Ramsey numbers
- Ramsey-nice families of graphs
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Chromatic numbers of layered graphs with a bounded maximal clique
- -boundedness and related problems on graphs without long induced paths: a survey
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
- Partitioning of a graph into induced subgraphs not containing prescribed cliques
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- Coloring Graphs with Dense Neighborhoods
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- A unified proof of Brooks' theorem and Catlin's theorem
- Joints in graphs
- Simple sublinear algorithms for (+1) vertex coloring via asymmetric palette sparsification
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- Special issue in honour of Landon Rabern
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs
- A strengthening of the Assmus-Mattson theorem
- (\(\Delta-k\))-critical graphs
- The chromatic number of \(\{P_2 \cup P_3,\text{ banner}\}\)-free graphs
- Graphs with \(\chi=\Delta\) have big cliques
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- On the chromatic number of \(\{\text{bull, diamond}\}\)-free graphs
- Asymptotically optimal frugal colouring
- On the Grundy number of a graph
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Dynamic proper colorings of a graph
- Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
- Borodin-Kostochka's conjecture on \(\{P_2\cup P_3, \,\,\text{gem, banner}\}\)-free graphs
- Bounds and monotonicity of critical set parameters of colourings
- Bounded VC-dimension implies the Schur-Erdős conjecture
- Brooks' Theorem and Beyond
- On the Grundy and b-chromatic numbers of a graph
This page was built for publication: A strengthening of Brooks' theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306303)
