Pages that link to "Item:Q6065420"
From MaRDI portal
The following pages link to Contracting to a longest path in H-free graphs (Q6065420):
Displaying 6 items.
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- The complexity of contracting bipartite graphs into small cycles (Q6039435) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)