Pages that link to "Item:Q266951"
From MaRDI portal
The following pages link to Algorithms for finding disjoint path covers in unit interval graphs (Q266951):
Displaying 7 items.
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)