Edge-disjoint branching in directed multigraphs
- 31 January 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (1) , 24-27
- https://doi.org/10.1016/0020-0190(79)90086-3
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On two minimax theorems in graphJournal of Combinatorial Theory, Series B, 1976
- Edge-disjoint spanning trees and depth-first searchActa Informatica, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- A good algorithm for edge-disjoint branchingInformation Processing Letters, 1974
- Efficient algorithms for determining an extremal tree of a graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Maximally Distant Trees and Principal Partition of a Linear GraphIEEE Transactions on Circuit Theory, 1969
- 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