The following pages link to Choosability of P 5-Free Graphs (Q3182940):
Displaying 6 items.
- On low tree-depth decompositions (Q897253) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
