Graph factors and factorization: 1985–2003: A survey
Author:
- Michael D. PlummerMPMichael D. Plummer
- 1 April 2007
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (7-8) , 791-821
Abstract
No abstract availableKeywords
This publication has 252 references indexed in Scilit:
- A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt V E)$ general graph maximum matching algorithmCombinatorica, 1994
- Star arboricityCombinatorica, 1992
- Minimum degree of bipartite graphs and the existence ofk-factorsGraphs and Combinatorics, 1990
- A sufficient condition for a graph to have [a, b]-factorsGraphs and Combinatorics, 1990
- A sufficient condition for a bipartite graph to have ak-factorJournal of Graph Theory, 1988
- Toughness and the existence of k‐factorsJournal of Graph Theory, 1985
- A remark on the factor theorems of lovász and tutteJournal of Graph Theory, 1981
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrixMathematical Notes, 1981
- Decomposition of Kn into subgraphs of prescribed typeArchiv der Mathematik, 1978
- Strong transfinite version of König's duality theoremMonatshefte für Mathematik, 1971