The Two Ear Theorem on Matching-Covered Graphs

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 1, 1998, Pages 104-109

  Szigeti, Zoltán ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001320880     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1824     Document Type: Article

References (9)

1. Anderson I. Perfect matchings of a graph. J. Combin. Theory Ser. B. 10:1971;183-186.
2. M. H. Carvalho, C. L. Lucchesi, U. S. R. Murty, Ear decompositions of matching covered graphs.
3. Hall P. On representatives of subsets. J. London Math. Soc. 10:1935;26-30.
4. Z. Király, The calculus of barriers.
5. Lovász L. On the structure of factorizable graphs. Acta Math. Acad. Sci. Hungar. 23:1972;179-195.
6. Lovász L., Plummer M. D. On bicritical graphs. Infinite and Finite Sets, II. Colloq. Math. Soc. J. Bolyai. 10:1975;North-Holland, Amsterdam. p. 1051-1079.
7. Lovász L., Plummer M. D. Matching Theory. 1986;North-Holland, Amsterdam.
8. Little C. H. C., Rendl F. An algorithm for the ear decomposition of a 1-factor covered graph. J. Austral. Math. Soc. Ser. A. 46:1989;296-301.
9. Tutte W. T. The factorization of linear graphs. J. London Math. Soc. 22:1947;107-111.