The following pages link to Note on the colouring of graphs (Q2649505):
Displaying 20 items.
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- On list critical graphs (Q1044925) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- Hadwiger's conjecture and inflations of the Petersen graph (Q1759395) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- On the density of \(C_7\)-critical graphs (Q2151187) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- The proper vertex-disconnection of graphs (Q2672620) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← 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)
- Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Coloring hammer-free graphs with \(\Delta - 1\) colors (Q6177425) (← links)
