References
L. W. Beineke andM. D. Plummer, On the 1-factors of a non-separable graph,J. Comb. Theory,2 (1967), pp. 285–289.
C. Berge, Sur le couplage maximum d'un graphe,C. R. Acad. Sciences,247 (1958), pp. 258–259.
J. Edmonds, Paths, trees and flowers,Can. J. Math.,17 (1965), pp. 449–467.
T. Gallai, Maximale Systeme unabhängiger Kanten,Mat. Kut. Int. Közl.,9 (1964), pp. 373–395.
M. Hall, Distinct representatives of subsets,Bull. Amer. Math. Soc.,54 (1948), pp. 922–926.
A. Hajnal andVera T., Sós, Problem,Combinatorial Theory and its Applications (Budapest, 1970), pp. 1163–1164.
G. Hetyei, 2×1-es téglalapokkal lefedhető idomokról,Pécsi Tanárképző Főisk. Tud. Közl., (1964), pp. 351–368 (Hungarian).
A. Kotzig, Ein Beitrag zur Theorie der endlichen Graphen mit linearen Faktoren I, II, III,Mat. Fyz. Casopis,9 (1959), pp. 73–91, 136–159, and10 (1960), pp. 205–215 (in Slovak, with a German summary).
L. Lovász, Subgraphs with prescribed valencies,J. Comb. Theory,8 (1970), pp. 391–416.
L. Lovász, On the structure of critical graphs, to appear inStudia Sci. Math. Hung.
W. T. Tutte, The factorization of linear graphs,J. London Math. Soc.,22 (1947), pp. 107–111.
J. Zaks, On the 1-factors ofn-connected graphs,Combinatorial Structures and Their Applications, (New York-London-Paris, 1970), pp. 481–488.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lovász, L. On the structure of factorizable graphs. Acta Mathematica Academiae Scientiarum Hungaricae 23, 179–195 (1972). https://doi.org/10.1007/BF01889914
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01889914