Pages that link to "Item:Q2949718"
From MaRDI portal
The following pages link to Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718):
Displayed 11 items.
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- A note on \(\Delta\)-critical graphs (Q6063276) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (Q6091818) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)