Erratum: Tight bound for matching (Journal of Combinatorial Optimization (2012) 23 (322-330) DOI: 10.1007/s10878-010-9299-5));Tight bound for matching

Journal of Combinatorial Optimization

Volumn 23, Issue 3, 2012, Pages 322-330

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Combinatorial problems; Graph algorithms; Lower bound; Matching

Indexed keywords

COMBINATORIAL MATHEMATICS;

COMBINATORIAL PROBLEM; CYCLE LENGTH; GRAPH ALGORITHMS; LOWER BOUNDS; MATCHING; MAXIMUM MATCHINGS; TIGHT BOUND; VERTEX DEGREE;

MATHEMATICAL TECHNIQUES;

EID: 84859270558     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-012-9566-8     Document Type: Erratum

References (9)

1. Biedl T, Demaine E, Duncan C, Fleischer R, Kobourov S (2004) Tight bounds on the maximal and maximum matchings. Discrete Math 285(1-3):7-15
2. Feng W, Qu W, Wang H (2007) Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. In: Proceedings of the 2007 international conference on foundations of computer science, Las Vegas, pp 110-113
3. Han Y (2008) Matching for graphs of bounded degree. In: Proceedings of the second international workshop on frontiers in algorithmics (FAW'2008), Changsha, China. Lecture notes in computer science, vol 5059. Springer, Berlin, pp 171-173
4. König D (1916) Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math Ann 77:453-456
5. Misra J, Gries D (1992) A constructive proof of Vizing's theorem. Inf Process Lett 41:131-133
6. Nishizeki T, Baybars I (1979) Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math 28(3):255-267
7. Petersen J (1891) Die Theorie der regulären Graphs (The theory of regular graphs). Acta Math 15:193-220
8. Tutte WT (1947) The factorization of linear graphs. J Lond Math Soc 22:107-111
9. Vizing VG (1964) On an estimate of chromatic class of a p-graph. Diskretn Anal 3:25-30 (in Russian)