Algorithmic proofs of two relations between connectivity and the 1-factors of a graph
- 31 December 1979
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 26 (1), 33-40
- https://doi.org/10.1016/0012-365x(79)90058-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some improved bounds on the number of 1-factors of n-connected graphsInformation Processing Letters, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- On the structure of factorizable graphsActa Mathematica Hungarica, 1972
- On the 1-factors of n-connected graphsJournal of Combinatorial Theory, Series B, 1971
- On the 1-factors of a non-separable graphJournal of Combinatorial Theory, 1967
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965