The following pages link to Colouring (P_r+P_s)-Free Graphs (Q5090995):
Displaying 8 items.
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- (Q5874489) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
