Pages that link to "Item:Q5300509"
From MaRDI portal
The following pages link to Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5300509):
Displaying 18 items.
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← 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)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Borodin-Kostochka conjecture holds for odd-hole-free graphs (Q6154380) (← links)
- Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs (Q6585266) (← links)
- Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs (Q6650716) (← links)
