A short proof of mader's L-paths theorem

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 2, 2001, Pages 319-321

  Schrijver, Alexander ^a,b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (5)

1. Berge C. Sur le couplage maximum d'un graphe. Compt. Rend. Hebdomadaires des Séances Acad. Sci. (Paris). 247:1958;258-259.
2. Gallai T. Maximum-minimum Sätze und verallgemeinerte Faktoren von Graphen. Acta Math. Acad. Sci. Hungaricae. 12:1961;131-173.
3. Lovász L. Matroid matching and some applications. J. Combin. Theory Ser. B. 28:1980;208-236.
4. Mader W. Über die Maximalzahl kreuzungsfreier H-Wege. Archiv Math. (Basel). 31:1978;387-402.
5. Tutte W. T. The factorization of linear graphs. J. London Math. Soc. 22:1947;107-111.