Pages that link to "Item:Q2864321"
From MaRDI portal
The following pages link to Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321):
Displaying 10 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- (Q5092436) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)