Pages that link to "Item:Q1707976"
From MaRDI portal
The following pages link to On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976):
Displaying 12 items.
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring Diamond-free Graphs. (Q5369518) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Near optimal colourability on hereditary graph families (Q6196836) (← links)
