The following pages link to \(k\)-path partitions in trees (Q1377668):
Displaying 17 items.
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- (Q4691777) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
