Matching theory: subgraphs with degree constraints and other properties

[1]  R. Brualdi.  Matrices of zeros and ones with fixed row and column sum vectors , 1980 .

[2]  D. Gale.  A theorem on flows in networks , 1957 .

[3]  Richard P. Anstee,et al.  The network flows approach for matrices with given row and column sums , 1983, Discret. Math..

[4]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[5]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[7]  D. R. Fulkerson,et al.  Multiplicities and minimal widths for (0,1)-matrices. , 1962 .

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

[9]  William T. Tutte.  The Subgraph Problem , 1978 .

[10]  D. R. Fulkerson,et al.  Widths and heights of (0,1)-matrices. , 1961 .

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

[12]  D. R. Fulkerson.  Zero-one matrices with zero trace. , 1960 .

[13]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[14]  Richard P. Anstee.  A Polynomial Algorithm for b-Matchings: An Alternative Approach , 1987, Inf. Process. Lett..

[15]  H. J. Ryser,et al.  Matrices of zeros and ones , 1960 .

[16]  L. Mirsky,et al.  Combinatorial theorems and integral matrices , 1968 .

[17]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[18]  D. R. Fulkerson.  A Network-Flow Feasibility Theorem and Combinatorial Applications , 1959, Canadian Journal of Mathematics.

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

[20]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

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

[22]  Existence theorem for infinite integral matrices , 1970 .

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

[24]  Ernst Snapper,et al.  Group characters and nonnegative integral matrices , 1971 .

[25]  Gérard Cornuéjols,et al.  General factors of graphs , 1988, J. Comb. Theory, Ser. B.

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

[27]  J. Edmonds,et al.  Facets of I-matching polyhedra , 1974 .

[28]  R. Baker.  Factorization of graphs , 1975 .