The following pages link to (\(\Delta-k\))-critical graphs (Q1767668):
Displaying 13 items.
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index (Q580363) (← links)
- \((a,b,k)\)-critical graphs (Q1375824) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- \((-1)\)-critical graphs. (Q2804805) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- (Q3571881) (← links)
- The existence problem of \(k\mathrm{-}\gamma_t\)-critical graphs (Q5964998) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
