An algorithmic proof of Tutte's f-factor theorem
- 1 March 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (1) , 112-131
- https://doi.org/10.1016/0196-6774(85)90022-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The network flows approach for matrices with given row and column sumsDiscrete Mathematics, 1983
- Graph factorsCombinatorica, 1981
- Subgraphs with prescribed valenciesJournal of Combinatorial Theory, 1970
- Combinatorial theorems and integral matricesJournal of Combinatorial Theory, 1968
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Some Properties of Graphs with Multiple EdgesCanadian Journal of Mathematics, 1965
- Traces of Matrices of Zeros and OnesCanadian Journal of Mathematics, 1960
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysisProceedings of Symposia in Applied Mathematics, 1960
- A Short Proof of the Factor Theorem for Finite GraphsCanadian Journal of Mathematics, 1954
- The Factors of GraphsCanadian Journal of Mathematics, 1952