Pages that link to "Item:Q1248527"
From MaRDI portal
The following pages link to Another bound on the chromatic number of a graph (Q1248527):
Displayed 11 items.
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Chromatic properties of the Pancake graphs (Q2364095) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)