On the complexity of partitioning graphs into connected subgraphs
- 1 February 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (2) , 139-153
- https://doi.org/10.1016/0166-218x(85)90008-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- The clique problem for planar graphsInformation Processing Letters, 1981
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- Max-Min Tree PartitioningJournal of the ACM, 1981
- A homology theory for spanning tress of a graphActa Mathematica Hungarica, 1977
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965