On the structure of factorizable graphs. II-Reference-Cited by-同舟云学术

On the structure of factorizable graphs. II

Published:1972-09 Issue:3-4 Volume:23 Page:465-478
ISSN:0001-5954
Container-title:Acta Mathematica Academiae Scientiarum Hungaricae
language:en
Short-container-title:Acta Mathematica Academiae Scientiarum Hungaricae

Author:

Lovász L.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01896966.pdf

Reference11 articles.

1. A. L. Dulmage andN. S. Mendelsohn, Coverings of bipartite graphs,Can. J. Math.,10 (1958), pp. 517–534.

2. J. Edmonds, Paths, trees and flowers,Canad. J. Math.,17 (1965), pp. 449–467.

3. T. Gallai, Maximale Systeme unabhängiger Kanten,MTA Mat. Kut. Int. Közl.,9 (1965), pp. 401–413.

4. G. Hetyei, Über die mit Rechtecken 2×1 bedeckbaren geometrischen Figuren (in Hungarian, with Russian and German summary),Pécsi Tanárképző Főisk. Közl. (1964), pp. 351–368.

5. A. Kotzig, Ein Beitrag zur Theorie der endlichen Graphen mit linearen Faktoren I-II-III (in Slovak, with a German summary).Mat. Fyz. Časopis,9 (1959), pp. 73–91, 136–159,10 (1960), pp. 205–215.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A note on extreme sets;Electronic Journal of Graph Theory and Applications;2017-10-30

2. On vertex-parity edge-colorings;Journal of Combinatorial Optimization;2017-09-27

3. Max-cut and extendability of matchings in distance-regular graphs;European Journal of Combinatorics;2017-05

4. On the size and structure of graphs with a constant number of 1-factors;Discrete Mathematics;2012-05

5. On the maximum number of edges in a hypergraph with a unique perfect matching;Discrete Mathematics;2011-11