Connectivity and edge-disjoint spanning trees
- 1 February 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (2) , 87-89
- https://doi.org/10.1016/0020-0190(83)90031-5
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Edge-disjoint branching in directed multigraphsInformation Processing Letters, 1979
- The subgraph homeomorphism problemPublished by Association for Computing Machinery (ACM) ,1978
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961