Pages that link to "Item:Q968410"
From MaRDI portal
The following pages link to Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410):
Displaying 11 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
- A quick way to verify if a graph is 3-colorable (Q6633531) (← links)
