The following pages link to Optimal chain partitions of trees (Q1223159):
Displayed 11 items.
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- A linear algorithm for the Hamiltonian completion number of a tree (Q1226105) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- \(k\)-path partitions in trees (Q1377668) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Chain partitioning as a key element for building vehicle routing problem heuristics (Q3620287) (← links)