Graph factors and factorization: 1985-2003: A survey

In the most general sense, a factor of a graph G is just a spanning subgraph of G and a graph factorization of G is a partition of the edges of G into factors. However, as we shall see in the present paper, even this extremely general definition does not capture all the factor and factorization problems that have been studied in graph theory. Several previous survey papers have been written on this subject [F. Chung, R. Graham, Recent results in graph decompositions, London Mathematical Society, Lecture Note Series, vol. 52, Cambridge University Press, 1981, pp. 103-123; J. Akiyama, M. Kano, Factors and factorizations of graphs-a survey, J. Graph Theory 9 (1985) 1-42; L. Volkmann, Regular graphs, regular factors, and the impact of Petersen's theorems, Jahresber. Deutsch. Math.-Verein. 97 (1995) 19-42] as well as an entire book on graph decompositions [J. Bosak, Decompositions of Graphs, Kluwer Academic Publishers Group, Dordrecht, 1990]. Our purpose here is to concentrate primarily on surveying the developments of the last 15-20 years in this exponentially growing field.

[1]  Akira Saito,et al.  2-factors in Claw-free Graphs , 2000, Discuss. Math. Graph Theory.

[2]  Yunsun Nam,et al.  Finite symmetric graphs with two-arc transitive quotients II , 2007 .

[3]  C. Lindner,et al.  On the number of 1-factorizations of the complete graph☆ , 1976 .

[4]  Zbigniew Lonc.  On the Complexity of Some Edge-partition Problems for Graphs , 1996, Discret. Appl. Math..

[5]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[6]  Norihide Tokushige.  Binding number and minimum degree for k-factors , 1989, J. Graph Theory.

[7]  Cun-Quan Zhang,et al.  Factorizations of regular graphs , 1992, J. Comb. Theory, Ser. B.

[8]  M. Hall.  Distinct representatives of subsets , 1948 .

[9]  Gérard Cornuéjols,et al.  Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem , 1983 .

[10]  Michael Plantholt,et al.  All Regular Multigraphs of Even Order and High Degree Are 1-factorable , 2001, Electron. J. Comb..

[11]  太田 克弘.  A sufficient condition for a bipartite graph to have a $k$-factor , 1986 .

[12]  Alexander K. Kelmans,et al.  Star partitions of graphs , 1997, J. Graph Theory.

[13]  Pavol Hell,et al.  Packings by complete bipartite graphs , 1986 .

[14]  Reinhard Diestel.  Decomposing infinite graphs , 1991, Discret. Math..

[15]  Eliška Tomová.  Decomposition of complete bipartite graphs into factors with given diameters , 1977 .

[16]  Mikio Kano,et al.  Factors of regular graphs , 1986, J. Comb. Theory, Ser. B.

[17]  Ken-ichi Kawarabayashi.  K 4 - -factor in a graph , 2002 .

[18]  P. Katerinis.  Two sufficient conditions for a 2-factor in a bipartite graph , 1987, J. Graph Theory.

[19]  Lutz Volkmann,et al.  On unique k-factors and unique [1, k]-factors in graphs , 2004, Discret. Math..

[20]  K. Steffens.  Matchings in countable graphs , 1977 .

[21]  Anthony J. W. Hilton,et al.  1-factorizing Regular Graphs of High Degree - an Improved Bound , 1989, Discret. Math..

[22]  Cai Mao-cheng.  [ a,b ]-factorizations of graphs , 1991 .

[23]  Hanna D. Robalewska.  2-factors in random regular graphs , 1996 .

[24]  Tsuyoshi Nishimura.  A degree condition for the existence of k-factors , 1992, J. Graph Theory.

[25]  G. Walter,et al.  Graphs and Matrices , 1999 .

[26]  Romeo Rizzi.  Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs , 2002, SIAM J. Discret. Math..

[27]  Lutz Volkmann,et al.  Neighbourhood and degree conditions for the existence of regular factors , 1996, Ars Comb..

[28]  Tsuyoshi Nishimura.  Component factors and induced subgraphs , 1996 .

[29]  L. Niepel.  On decompositions of complete graphs into factors with given diameters and radii , 1980 .

[30]  László Lovász.  On decomposition of graphs , 1966 .

[31]  Hikoe Enomoto,et al.  Graph decompositions without isolated vertices III , 1997 .

[32]  R. Rado,et al.  FACTORIZATION OF EVEN GRAPHS , 1949 .

[33]  Lutz Volkmann,et al.  Extremal bipartite graphs with a unique k-factor , 2006, Discuss. Math. Graph Theory.

[34]  Mohamed H. El-Zahar,et al.  On circuits in graphs , 1984, Discret. Math..

[35]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[36]  Alexander K. Kelmans.  Optimal packing of induced stars in a graph , 1997, Discret. Math..

[37]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[38]  Mao-cheng Cai,et al.  A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k + 1]-FACTORS , 1995 .

[39]  Yoshimi Egawa,et al.  Two-factors each component of which contains a specified vertex , 2003 .

[40]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[41]  R. W. Robinson,et al.  Isomorphic factorisations III: Complete multipartite graphs , 1978 .

[42]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[43]  Haruhide Matsuda.  Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle , 2002, Australas. J Comb..

[44]  D. Jungnickel,et al.  Balanced network flows. I. A unifying framework for design and analysis of matching algorithms , 1999 .

[45]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[46]  Takao Nishizeki,et al.  Lower bounds on the cardinality of the maximum matchings of planar graphs , 1979, Discret. Math..

[47]  Christian Fremuth-Paeger.  Degree constrained subgraph problems and network flow optimization , 1997 .

[48]  Michal Karonski,et al.  A review of random graphs , 1982, J. Graph Theory.

[49]  David G. Kirkpatrick,et al.  Rounding in Symmetric Matrices and Undirected Graphs , 1996, Discret. Appl. Math..

[50]  Prosenjit Bose,et al.  Efficient algorithms for Petersen's matching theorem , 1999, SODA '99.

[51]  Mikio Kano,et al.  Structure theorem and algorithm on (1, f)-odd subgraph , 2007, Discret. Math..

[52]  Bruce A. Reed,et al.  Edge coloring regular graphs of high degree , 1997, Discret. Math..

[53]  G. Egorychev.  The solution of van der Waerden's problem for permanents , 1981 .

[54]  Anthony J. W. Hilton.  Factorizations of regular graphs of high degree , 1985, J. Graph Theory.

[55]  Bing Liu,et al.  The Dynamics of a Prey–dependent Consumption Model Concerning Integrated Pest Management , 2005 .

[56]  Christophe Picouleau.  Complexity of the Hamiltonian Cycle in Regular Graph Problem , 1994, Theor. Comput. Sci..

[57]  David Hartvigsen,et al.  The Square-Free 2-Factor Problem in Bipartite Graphs , 1999, IPCO.

[58]  Yu Qinglin.  On barrier sets of star-factors , 1990 .

[59]  Akira Saito.  One-factors and k-factors , 1990, Discret. Math..

[60]  Stefan Znám.  On a conjecture of bollobás and bosák , 1982, J. Graph Theory.

[61]  Yoshimi Egawa,et al.  Regular factors in K1, n free graphs , 1991, J. Graph Theory.

[62]  Carsten Thomassen.  Graph decomposition with constraints on the connectivity and minimum degree , 1983, J. Graph Theory.

[63]  Karsten Steffens.  Injective Choice Functions , 1974, J. Comb. Theory, Ser. A.

[64]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[65]  Nigel Martin.  Complete bipartite factorisations of Kn, n , 2003, Discret. Math..

[66]  G. Liu.  ON (g, f)-COVERED GRAPHS , 1988 .

[67]  R. Graham,et al.  Combinatorics: Recent results in graph decompositions , 1981 .

[68]  D. R. Woodall.  k-Factors and Neighbourhoods of Independent Sets in Graphs , 1990 .

[69]  Petra Johann.  On the structure of graphs with a unique k-factor , 2000, J. Graph Theory.

[70]  D. Sumner.  1‐Factors and Antifactor Sets , 1976 .

[71]  Dieter Jungnickel,et al.  Balanced network flows. IV. Duality and structure theory , 2001, Networks.

[72]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[73]  Jianxiang Li.  On neighborhood condition for graphs to have [a, b]-factors , 2003, Discret. Math..

[74]  Alexander K. Kelmans,et al.  On packing 3-vertex paths in a graph , 2001, J. Graph Theory.

[75]  E. Balas.  Integer and Fractional Matchings , 1981 .

[76]  Frank Niedermeyer.  f-Optimal factors of infinite graphs , 1991, Discret. Math..

[77]  Alexander Rosa,et al.  One-factorizations of the complete graph - A survey , 1985, J. Graph Theory.

[78]  Jack Edmonds,et al.  Matching: A Well-Solved Class of Integer Linear Programs , 2001, Combinatorial Optimization.

[79]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[80]  Peter L. Hammer,et al.  Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization , 1997 .

[81]  Binhai Zhu,et al.  On Connected [k, k+1]-Factors in Claw-Free Graphs , 2002, Ars Comb..

[82]  Shinya Fujita.  Vertex-Disjoint K1, t's in Graphs , 2002, Ars Comb..

[83]  Michael C. Loui,et al.  The general maximum matching algorithm of micali and vazirani , 1988, Algorithmica.

[84]  A. Hilton,et al.  Class 1 graphs associated with regular graphs of high degree , 2002 .

[85]  J. P. Uhry.  Sur le problème du couplage maximal , 1975 .

[86]  Ebad Mahmoodian.  On factors of a graph , 1977 .

[87]  Richard P. Anstee,et al.  More sufficient conditions for a graph to have factors , 1998, Discret. Math..

[88]  David P. Sumner.  On Tutte's factorization theorem , 1974 .

[89]  Ken-ichi Kawarabayashi,et al.  Path factors in cubic graphs , 2002, J. Graph Theory.

[90]  Gottfried Tinhofer,et al.  On certain classes of fractional matchings , 1984, Discret. Appl. Math..

[91]  Jin Akiyama,et al.  Almost-regular factorization of graphs , 1985, J. Graph Theory.

[92]  Yanjun Li,et al.  A [k,k+1]-factor containing given Hamiltonian cycle , 1999, Electron. J. Comb..

[93]  Takao Nishizeki,et al.  On the relationship between the genus and the cardinality of the maximum matchings of a graph , 1979, Discret. Math..

[94]  L. Lovász.  A homology theory for spanning tress of a graph , 1977 .

[95]  Nicholas C. Wormald.  Isomorphic factorizations VII. Regular graphs and tournaments , 1984, J. Graph Theory.

[96]  Thomas Niessen,et al.  Regular factors of simple regular graphs and factor-spectra , 1998, Discret. Math..

[97]  William Kocay,et al.  Balanced Network Flows , 2001 .

[98]  A. Gardiner.  Embedding k-Regular Graphs in k + 1-Regular Graphs , 1983 .

[99]  Pavol Hell.  Graph Packings , 2000, Electron. Notes Discret. Math..

[100]  Svante Janson,et al.  The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph , 1994, Combinatorics, Probability and Computing.

[101]  Gao Hangshan,et al.  On (g, f)-factorizations of graphs , 1997 .

[102]  Yan Liu,et al.  The fractional matching numbers of graphs , 2002, Networks.

[103]  Shailesh K. Tipnis,et al.  Regular Multigraphs of High Degree are 1‐Factorizable , 1991 .

[104]  Bruce A. Reed,et al.  Star arboricity , 1992, Comb..

[105]  Egerváry Research Group on Combinatorial Optimization , 1999 .

[106]  Gérard Cornuéjols,et al.  Perfect triangle-free 2-matchings , 1980 .

[107]  Saharon Shelah,et al.  A General Criterion for the Existence of Transversals , 1983 .

[108]  Anthony J. W. Hilton,et al.  Canonical edge-colourings of locally finite graphs , 1982, Comb..

[109]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[110]  Mikio Kano.  Sufficient conditions for a graph to have factors , 1990, Discret. Math..

[111]  Hanna D. Robalewska,et al.  1-Factorizations of random regular graphs , 1997, Random Struct. Algorithms.

[112]  S. Fiorini,et al.  A bibliographic survey of edge-colorings , 1978, J. Graph Theory.

[113]  G Liu,et al.  ISOLATED TOUGHNESS AND THE EXISTENCE OF FRACTIONAL FACTORS , 2003 .

[114]  W. T. Tuttle.  Spanning subgraphs with specified valencies , 1974, Discret. Math..

[115]  P. Erdos,et al.  On the existence of a factor of degree one of a connected random graph , 1966 .

[116]  Atsushi Kaneko,et al.  A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two , 2003, J. Comb. Theory, Ser. B.

[117]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[118]  Jian-Liang Wu.  On the linear arboricity of planar graphs , 1999, J. Graph Theory.

[119]  刘桂真,et al.  FRACTIONAL (g, f)-FACTORS OF GRAPHS , 2001 .

[120]  Ron Aharoni,et al.  Infinite matching theory , 1991, Discret. Math..

[121]  Andrzej Rucińiski.  Subgraphs of Random Graphs: A General Approach , 1985 .

[122]  Brendan D. McKay,et al.  The number of matchings in random regular graphs and bipartite graphs , 1986, J. Comb. Theory, Ser. B.

[123]  Michel Las Vergnas.  An extension of Tutte's 1-factor theorem , 1978, Discret. Math..

[124]  N. Wormald,et al.  Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs , 1988 .

[125]  Sukhamay Kundu.  The k-factor conjecture is true , 1973, Discret. Math..

[126]  Daniel Palumbíny.  On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters , 1972 .

[127]  Ian Holyer,et al.  The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..

[128]  A. Hajnal.  On spanned subgraphs of graphs , 1977 .

[129]  Tao Jiang,et al.  Vertex‐disjoint cycles containing prescribed vertices , 2003, J. Graph Theory.

[130]  D. Falikman.  Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , 1981 .

[131]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[132]  Mekkia Kouider,et al.  Connected [a,b]-factors in Graphs , 2002, Comb..

[133]  Filip Guldan.  Some results on linear arboricity , 1986 .

[134]  R. Schelp,et al.  Closure, 2-factors, and cycle coverings in claw-free graphs , 1999 .

[135]  Hikoe Enomoto,et al.  Toughness and the existence of k-factors , 1985, J. Graph Theory.

[136]  Paul A. Catlin,et al.  Subgraphs of graphs, I , 1974, Discret. Math..

[137]  Jerzy Topp,et al.  Odd factors of a graph , 1993, Graphs Comb..

[138]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[139]  Klaus-Peter Podewski,et al.  Injective choice functions for countable families , 1976, J. Comb. Theory, Ser. B.

[140]  K. Steffens.  Maximal tight sets and the edmonds—Gallai decomposition for matchings , 1985, Comb..

[141]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[142]  Bruce A. Reed,et al.  Linear Arboricity of Random Regular Graphs , 1990, Random Struct. Algorithms.

[143]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[144]  Hikoe Enomoto,et al.  Complete-factors and f-factors , 2000, Discret. Math..

[145]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[146]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[147]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[148]  Li Guojun,et al.  On connected factors inK1,3-free graphs , 1998 .

[149]  Yoshimi Egawa,et al.  K1, 3-factors in graphs , 2008, Discret. Math..

[150]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[151]  Noga Alon,et al.  Every 4-regular graph plus an edge contains a 3-regular subgraph , 1984, Journal of combinatorial theory. Series B (Print).

[152]  刘振宏,et al.  ON CONNECTED FACTORS IN K 1,3 -FREE GRAPHS , 1998 .

[153]  Lutz Volkmann,et al.  Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree , 1990, J. Graph Theory.

[154]  Ron Aharoni.  König's Duality Theorem for Infinite Bipartite Graphs , 1984 .

[155]  David G. Kirkpatrick,et al.  A simple existence criterion for (g , 1990, Discret. Math..

[156]  Bill Jackson,et al.  A note concerning graphs with unique f-factors , 1989, J. Graph Theory.

[157]  Tsuyoshi Nishimura.  Independence number, connectivity, and r-factors , 1989, J. Graph Theory.

[158]  Tsuyoshi Nishimura.  Regular factors of line graphs , 1990, Discret. Math..

[159]  Ron Aharoni,et al.  Matchings in infinite graphs , 1988, J. Comb. Theory, Ser. B.

[160]  F. Violet,et al.  on a , 2021 .

[161]  D. R. Fulkerson,et al.  Some Properties of Graphs with Multiple Edges , 1965, Canadian Journal of Mathematics.

[162]  Haruhide Matsuda.  A Neighborhood Condition for Graphs to Have [a, b]-Factors II , 2002, Graphs Comb..

[163]  Derek G. Corneil,et al.  The complexity of regular subgraph recognition , 1990, Discret. Appl. Math..

[164]  Lutz Volkmann,et al.  On Regular Factors in Regular Graphs with Small Radius , 2004, Electron. J. Comb..

[165]  Dieter Jungnickel,et al.  Balanced network flows. II. Simple augmentation algorithms , 1999 .

[166]  Yoshimi Egawa,et al.  Factors and induced subgraphs , 1988, Discret. Math..

[167]  Ronald J. Gould,et al.  Updating the hamiltonian problem - A survey , 1991, J. Graph Theory.

[168]  P. Katerinis.  Toughness of graphs and the existence of factors , 1990, Discret. Math..

[169]  P. J. McCarthy.  Matchings in graphs II , 1975, Discret. Math..

[170]  J. Plesník.  Complexity of decomposing graphs into factors with given diameters or radii , 1982 .

[171]  W. T. Tutte.  Spanning subgraphs with specified valencies , 2006, Discret. Math..

[172]  Hiroshi Era.  A Note on Semiregular Factorizations of Regular Graphs , 1984 .

[173]  Mark N. Ellingham,et al.  Isomorphic factorization of r-regular graphs into r parts , 1988, Discret. Math..

[174]  Atsushi Amahashi.  On factors with all degrees odd , 1985, Graphs Comb..

[175]  Taro Tokuda.  A Degree Condition for the Existence of $[a,b]$-Factors in $K_{1,n}$-Free Graphs , 1998 .

[176]  Daniel J. Kleitman,et al.  Algorithms for constructing graphs and digraphs with given valences and factors , 1973, Discret. Math..

[177]  William R. Pulleyblank,et al.  König-Egerváry graphs, 2-bicritical graphs and fractional matchings , 1989, Discret. Appl. Math..

[178]  Ruthann Robson.  A/K/A , 1997 .

[179]  Haruhide Matsuda,et al.  Regular Factors Containing a Given Hamiltonian Cycle , 2003, IJCCGGT.

[180]  Béla Bollobás,et al.  Regular factors of regular graphs , 1985, J. Graph Theory.

[181]  J. Płonka.  On Γ-regular graphs , 1982 .

[182]  J. Schönheim,et al.  Decomposition of Kn into subgraphs of prescribed type , 1978 .

[183]  A. Hilton,et al.  Star multigraphs with three vertices of maximum degree , 1986 .

[184]  B. Péroche,et al.  Complexité de l'arboricité linéaire d'un graphe , 1982 .

[185]  William R. Pulleyblank.  Fractional matchings and the Edmonds-Gallai theorem , 1987, Discret. Appl. Math..

[186]  N. Alon.  The linear arboricity of graphs , 1988 .

[187]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[188]  Alexander Schrijver.  Bipartite Edge Coloring in O(Delta m) Time , 1998, SIAM J. Comput..

[189]  Noga Alon,et al.  Linear Arboricity and Linear k-Arboricity of Regular Graphs , 2001, Graphs Comb..

[190]  Mikio Kano,et al.  Odd subgraphs and matchings , 2002, Discret. Math..

[191]  Yanjun Li,et al.  A degree condition for a graph to have [a, b]-factors , 1998, J. Graph Theory.

[192]  Keiko Kotani.  Factors and Connected Induced Subgraphs , 2001, Graphs Comb..

[193]  Aung Kyaw,et al.  A Sufficient Condition for a Graph to Have a k-tree , 2001, Graphs Comb..

[194]  Ng Lx.  EVERY 4-REGULAR SIMPLE GRAPH CONTAINS A 3-REGULAR SUBGRAPH , 1986 .

[195]  Ron Aharoni.  Matchings in infinte graphs , 1987 .

[196]  Yoshimi Egawa,et al.  Vertex-disjoint claws in graphs , 1999, Discret. Math..

[197]  G. Liu,et al.  Fractional (g, f)-factors of graphs , 2001 .

[198]  Hikoe Enomoto,et al.  Graph decompositions without isolated vertices II , 1997 .

[199]  Péter Hajnal.  Partition of graphs with condition on the connectivity and minimum degree , 1983, Comb..

[200]  W. Pulleyblank.  Matchings and extensions , 1996 .

[201]  James B. Orlin,et al.  Dynamic matchings and quasidynamic fractional matchings. I , 1983, Networks.

[202]  David G. Kirkpatrick,et al.  On Generalized Matching Problems , 1981, Inf. Process. Lett..

[203]  Michael D. Plummer,et al.  Extending matchings in graphs: A survey , 1994, Discret. Math..

[204]  Frank Harary,et al.  Covering and packing in graphs IV: Linear arboricity , 1981, Networks.

[205]  Michael Molloy,et al.  The Probabilistic Method , 1998 .

[206]  Norbert Blum,et al.  A New Approach to Maximum Matching in General Graphs , 1990, ICALP.

[207]  Edward Allburn,et al.  Graph decomposition , 1990 .

[208]  Yoshimi Egawa,et al.  Sufficient conditions for graphs to have (g, f)-factors , 1996, Discret. Math..

[209]  David G. Kirkpatrick,et al.  On Restricted Two-Factors , 1988, SIAM J. Discret. Math..

[210]  Arne Hoffmann.  Regular Factors in Connected Regular Graphs , 2003, Ars Comb..

[211]  Mark N. Ellingham.  Isomorphic factorization of regular graphs of even degree , 1988 .

[212]  Mikio Kano,et al.  On factors with given components , 1982, Discret. Math..

[213]  Alexander Rosa,et al.  Decompositions of Complete Graphs into Factors with Diameter Two , 1971 .

[214]  Carsten Thomassen.  A remark on the factor theorems of lovász and tutte , 1981, J. Graph Theory.

[215]  Mekkia Kouider,et al.  Connected Factors in Graphs – a Survey , 2005, Graphs Comb..

[216]  Ian Anderson,et al.  Sufficient conditions for matchings , 1972 .

[217]  László Lovász,et al.  Subgraphs with prescribed valencies , 1970 .

[218]  Douglas F. Rall,et al.  Star‐factors and k‐bounded total domination , 1996 .

[219]  Gérard Cornuéjols,et al.  An extension of matching theory , 1986, J. Comb. Theory, Ser. B.

[220]  Mikio Kano.  Graph factors with given properties , 1984 .

[221]  S. J. Quinn.  Isomorphic factorizations of complete equipartite graphs , 1983, J. Graph Theory.

[222]  Mikio Kano,et al.  Some results on odd factors of graphs , 1988, J. Graph Theory.

[223]  Denise Maria Vieira,et al.  CARACTERÍSTICAS MICROBIOLÓGICAS DE CARNE DE SIRI BENEFICIADA EM ANTONINA (PR) ANTES E APÓS A ADOÇÃO DE MEDIDAS DE BOAS PRÁTICAS , 2006 .

[224]  Hikoe Enomoto.  Graph Decompositions without Isolated Vertices , 1995, J. Comb. Theory, Ser. B.

[225]  Vijay V. Vazirani,et al.  A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..

[226]  Richard P. Anstee,et al.  Convexity of degree sequences , 1999, J. Graph Theory.

[227]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[228]  P. J. McCarthy.  Matchings in graphs III: Infinite graphs , 1978 .

[229]  Yanjun Li,et al.  A degree condition for the existence of connected factors , 1996, Australas. J Comb..

[230]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[231]  Noga Alon,et al.  Packing and covering dense graphs , 1998 .

[232]  Anthony J. W. Hilton,et al.  Edge‐Colorings of Graphs: A Progress Report , 1989 .

[233]  Béla Bollobás,et al.  Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k , 2000 .

[234]  W. T. Tutte.  Graph factors , 1981, Comb..

[235]  Liu Guizhen.  Fractional k-Factors of Graphs , 2005 .

[236]  Arne Hoffmann.  Regular factors in regular multipartite graphs , 2000, Electron. Notes Discret. Math..

[237]  R. W. Robinson,et al.  Isomorphic factorisations. I. Complete graphs , 1978 .

[238]  Hong Wang,et al.  Vertex-Disjoint Cycles Containing Specified Edges , 2000, Graphs Comb..

[239]  Romeo Rizzi,et al.  Edge-Coloring Bipartite Graphs , 2000, J. Algorithms.

[240]  Mao-cheng Cai.  Connected [k, k + 1]-factors of graphs , 1997, Discret. Math..

[241]  Martin Loebl,et al.  Subgraph Packing — A Survey , 1990 .

[242]  Richard A. Brualdi,et al.  Strong transfinite version of König's duality theorem , 1971 .

[243]  Ian P. Goulden,et al.  Graph factorization, general triple systems, and cyclic triple systems , 1981 .

[244]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[245]  P. Katerinis.  Some conditions for the existence of f-factors , 1985, J. Graph Theory.

[246]  P. J. McCarthy.  Matchings in graphs , 1973, Bulletin of the Australian Mathematical Society.

[247]  László Lovász.  Valencies of graphs with 1-factors , 1974 .

[248]  Gérard Cornuéjols,et al.  Packing subgraphs in a graph , 1982, Oper. Res. Lett..

[249]  Chak-Kuen Wong,et al.  Decomposition of Graphs into (g, f)-Factors , 2000, Graphs Comb..

[250]  Nigel Martin.  Complete bipartite factorisations by complete bipartite graphs , 1997, Discret. Math..

[251]  Klaus-Peter Podewski,et al.  Matchable Infinite Graphs , 1994, J. Comb. Theory, Ser. B.

[252]  Ron Aharoni.  A generalization of Tutte's 1-factor theorem to countable graphs , 1984, J. Comb. Theory, Ser. B.

[253]  Mark N. Ellingham,et al.  Connected (g, f)-factors , 2002 .

[254]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[255]  P. Hall.  On Representatives of Subsets , 1935 .

[256]  A. Kotzig,et al.  Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter , 1975 .

[257]  Oscar Moreno,et al.  Three-regular Subgraphs of Four-regular Graphs' , 1998, Eur. J. Comb..

[258]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

[259]  R. Diestel.  Graph Decompositions: A Study in Infinite Graph Theory , 1990 .

[260]  Anthony J. W. Hilton,et al.  Recent progress on edge-colouring graphs , 1987, Discret. Math..

[261]  Mikio Kano.  [a, B]-factorization of a Graph , 1985, J. Graph Theory.

[262]  Ralph J. Faudree,et al.  Degree conditions for 2-factors , 1997, J. Graph Theory.

[263]  Charles H. C. Little,et al.  On defect-d matchings in graphs , 1975, Discret. Math..

[264]  Jörg R. Mühlbacher.  F-Factors of Graphs: A Generalized Matching Problem , 1979, Inf. Process. Lett..

[265]  Endre Szemerédi,et al.  Spanning subgraphs of dense graphs and a combinatorial problem on strings , 1998 .

[266]  Ján Plesník,et al.  A note on the complexity of finding regular subgraphs , 1984, Discret. Math..

[267]  E. Upfal,et al.  On factors in random graphs , 1981 .

[268]  Andras Hajnal,et al.  On the maximal number of independent circuits in a graph , 1963 .

[269]  Eliška Tomová.  On the decomposition of complete directed graphs into factors with given radii , 1986 .

[270]  Tsuyoshi Nishimura,et al.  Neighborhood Conditions and $k$-Factors , 1997 .

[271]  Noga Alon,et al.  Regular subgraphs of almost regular graphs , 1984, J. Comb. Theory, Ser. B.

[272]  G. R. T. Hendry.  Maximum graphs with a unique k-factor , 1984, J. Comb. Theory, Ser. B.

[273]  Robin J. Wilson,et al.  Edge-colourings of graphs , 1977 .

[274]  Richard P. Anstee,et al.  An Algorithmic Proof of Tutte's f-Factor Theorem , 1985, J. Algorithms.

[275]  Jean-Claude Bermond,et al.  Regular factors in nearly regular graphs , 1984, Discret. Math..

[276]  Cai Mao-cheng,et al.  A degree condition for a graph to have [ a, b ]-factors , 1998 .

[277]  Štefan Znám,et al.  On Decompositions of Complete Graphs into Factors with Given Radii , 1973 .

[278]  Alan M. Frieze,et al.  Perfect Matchings in Random s-Uniform Hypergraphs , 1995, Random Struct. Algorithms.

[279]  Dalibor Froncek.  Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters , 1996, Australas. J Comb..

[280]  Haruhide Matsuda.  A neighborhood condition for graphs to have [a, b]-factors , 2000, Discret. Math..

[281]  Daniel Palumbíny,et al.  Isomorphic factorisations of complete graphs into factors with a given diameter , 1987 .

[282]  Eli Upfal,et al.  One-factor in random graphs based on vertex choice , 1982, Discret. Math..

[283]  Anthony J. W. Hilton,et al.  The Overfull Conjecture and the Conformability Conjecture , 2001, Discret. Math..

[284]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[285]  Dean G. Hoffman,et al.  On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs , 1996, Discret. Math..

[286]  Alan M. Frieze,et al.  Perfect Matchings in Random r-regular, s-uniform Hypergraphs , 1996, Combinatorics, Probability and Computing.

[287]  Haruhide Matsuda.  Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle , 2004, Discret. Math..

[288]  Ken-ichi Kawarabayashi,et al.  Path factors in claw-free graphs , 2002, Discret. Math..

[289]  A. Schrijver,et al.  On lower bounds for permanents , 1979 .

[290]  Richard P. Anstee.  Simplified existence theorems for (g, f)-factors , 1990, Discret. Appl. Math..

[291]  Alexander Schrijver,et al.  Counting 1-Factors in Regular Bipartite Graphs , 1998, J. Comb. Theory B.

[292]  Juraj Bosák.  Disjoint factors of diameter two in complete graphs , 1974 .

[293]  Haim Kaplan,et al.  Unique maximum matching algorithms , 1999, STOC '99.

[294]  Béla Bollobás,et al.  A Tribute to Paul Erdős: Hamilton cycles in random graphs of minimal degree at least k , 1990 .

[295]  Richard H. Schelp,et al.  Closure, 2-factors, and cycle coverings in claw-free graphs , 1999, J. Graph Theory.

[296]  A. Schrijver.  Bounds on permanents, and the number of 1-factors and 1-factorizations in bipatite graphs , 1983 .

[297]  F. Baebler.  Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung , 1937 .

[298]  Jin Akiyama,et al.  Factors and factorizations of graphs - a survey , 1985, J. Graph Theory.

[299]  John R. Beaumont,et al.  Studies on Graphs and Discrete Programming , 1982 .

[300]  Juraj Bosák,et al.  Decompositions of Graphs , 1990 .

[301]  B. Reed.  Graph Colouring and the Probabilistic Method , 2001 .

[302]  Frank X. Steinparz.  On the Existence of F-Factors , 1981, WG.

[303]  Wai-Kai Chen,et al.  On f-factors of a graph , 1985 .

[304]  F. Harary,et al.  Covering and packing in graphs. III: Cyclic and acyclic invariants , 1980 .

[305]  Ronald J. Gould,et al.  Advances on the Hamiltonian Problem – A Survey , 2003, Graphs Comb..

[306]  Atsushi Kaneko,et al.  On a 2-factor with a specified edge in a graph satisfying the Ore condition , 2002, Discret. Math..

[307]  Akira Saito,et al.  [a, B]-factors of Graphs , 1983, Discret. Math..

[308]  Bernard Péroche,et al.  Some problems about linear arboricity , 1982, Discret. Math..

[309]  T. Gustavsson.  Decompositions of large graphs and digraphs with high minimum degree , 1991 .

[310]  Norihide Tokushige,et al.  Binding numbers and f-factors of graphs , 1992, J. Comb. Theory, Ser. B.

[311]  David G. Kirkpatrick,et al.  On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..

[312]  Thomas Niessen,et al.  A Characterization of Graphs Having All (g, f)-Factors , 1998, J. Comb. Theory, Ser. B.

[313]  P. Katerinis,et al.  BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS , 1987 .

[314]  Bruce A. Reed,et al.  Almost Every Graph can be Covered by Linear Forests , 1995, Combinatorics, Probability and Computing.

[315]  Mikio Kano.  A sufficient condition for a graph to have [a, b]-factors , 1990, Graphs Comb..

[316]  James B. Orlin,et al.  Dynamic matchings and quasidynamic fractional matchings. II , 1983, Networks.

[317]  Tsuyoshi Nishimura,et al.  An ore-type condition for the existence ofk-factors in graphs , 1991, Graphs Comb..

[318]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[319]  Dieter Jungnickel,et al.  Balanced Network Flows. III. Strongly Polynomial Augmentation Algorithms , 1999 .

[320]  Robert Johansson.  On the bipartite case of El-Zahárs conjecture , 2000, Discret. Math..

[321]  A. Hajnal,et al.  On decomposition of graphs , 1967 .

[322]  Richard A. Shore,et al.  On the strength of König's duality theorem for infinite bipartite graphs , 1992, J. Comb. Theory, Ser. B.

[323]  Baoguang Xu,et al.  Connected Factors in K1,n-free Graphs Containing a (g, f)-factor , 1998, Graphs Comb..

[324]  Alexander Schrijver.  Bipartite edge-colouring in O( m) time1 , 1999 .

[325]  W. T. Tutte.  The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[326]  P. Katerinis.  Minimum degree of bipartite graphs and the existence ofk-factors , 1990, Graphs Comb..

[327]  P. Hrnčiar.  On decompositions of complete graphs into three factors with given diameters , 1990 .

[328]  Yoshimi Egawa,et al.  Graph decompositions through prescribed vertices without isolates , 2002, Ars Comb..

[329]  Anthony J. W. Hilton.  (r, R+1)-factorizations of (d, D+1)-graphs , 2008, Discret. Math..

[330]  Peter Horák,et al.  Decomposing 4-Regular Graphs into Triangle-Free 2-Factors , 1997, SIAM J. Discret. Math..

[331]  Ciping Chen,et al.  Odd and Even Factors of Graphs with Given Properties , 1991 .