F-factors of graphs: A generalized matching problem
- 30 April 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (4) , 207-214
- https://doi.org/10.1016/0020-0190(79)90026-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Algorithmus 23 Ein verbesserter MatchingalgorithmusComputing, 1974
- Bestimmung eines maximalen Matching in beliebigen GraphenComputing, 1972
- Die Theorie der regulären graphsActa Mathematica, 1891