scientific article; zbMATH DE number 3719178
From MaRDI portal
Publication:3909076
zbMATH Open0459.05038MaRDI QIDQ3909076FDOQ3909076
Authors: Alexandr Kostochka 
Publication date: 1980
Title of this publication is not available (Why is that?)
Cited In (23)
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
- A different short proof of Brooks' theorem
- A note on coloring vertex-transitive graphs
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs
- A note on \(\Delta\)-critical graphs
- Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs
- Coloring hammer-free graphs with \(\Delta - 1\) colors
- Large cliques in graphs with high chromatic number
- Graph theory (algorithmic, algebraic, and metric problems)
- Chromatic numbers of layered graphs with a bounded maximal clique
- A note on hitting maximum and maximal cliques with a stable set
- 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
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs
- On hitting all maximum cliques with an independent set
- A strengthening of Brooks' theorem
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Graphs with \(\chi=\Delta\) have big cliques
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Brooks' Theorem and Beyond
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)
