k-path partitions in trees
From MaRDI portal
Publication:1377668
DOI10.1016/S0166-218X(97)00012-7zbMATH Open0890.68101MaRDI QIDQ1377668FDOQ1377668
Stephen T. Hedetniemi, Sandra M. Hedetniemi, Gerard Jennhwa Chang, Jing-Ho Yan
Publication date: 11 June 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Optimal path cover problem on block graphs and bipartite permutation graphs
- A survey of gossiping and broadcasting in communication networks
- Linear algorithm for optimal path cover problem on interval graphs
- The $L(2,1)$-Labeling Problem on Graphs
- On the optional hamiltonian completion problem
- An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
- Minimum node disjoint path covering for circular-arc graphs
- Optimal chain partitions of trees
- The path-partition problem in block graphs
- Hamiltonian circuits and path coverings of vertices in graphs
Cited In (22)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Approximation algorithms for the directed path partition problems
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- Approximation algorithms for covering vertices by long paths
- On a relation between \(k\)-path partition and \(k\)-path vertex cover
- Path partition for graphs with special blocks
- A local search algorithm for the \(k\)-path partition problem
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem
- Title not available (Why is that?)
- A boundary class for the \(k\)-path partition problem
- An improved approximation algorithm for the minimum 3-path partition problem
- Parameterized complexity of \((A,\ell)\)-path packing
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Approximating the directed path partition problem
- Improved approximation algorithms for the \(k\)-path partition problem
- On the \(k\)-path cover problem for cacti
- Title not available (Why is that?)
- Approximation algorithms for some minimum postmen cover problems
- The path partition problem and related problems in bipartite graphs
- A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES
- Star Partitions of Perfect Graphs
- On the \(k\)-path partition of graphs.
This page was built for publication: \(k\)-path partitions in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377668)
