Matching for graphs of bounded degree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5059 LNCS, Issue , 2008, Pages 171-173

  Han, Yijie ^a  

^a UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Lower bound; Matching

Indexed keywords

NEODYMIUM; TELECOMMUNICATION NETWORKS;

ALGORITHMICS; BOUNDED DEGREES; HEIDELBERG (CO); INTERNATIONAL (CO); SPRINGER (CO);

GRAPH THEORY;

EID: 45849130184     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69311-6_19     Document Type: Conference Paper

References (6)

1. Biedl, T., Demaine, E., Duncan, C., Fleischer, R., Kobourov, S.: Tight bounds on the maximal and maximum matchings. Discrete Math. 285(1-3), 7-15 (2004)
2. Feng, W., Qu, W., Wang, H.: Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. In: Proc. 2007 Int. Conf. on Foundations of Computer Science, Las Vegas, pp. 110-113 (2007)
3. König, D.: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77, 453-456 (1916)
4. Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3), 255-267 (1979)
5. Petersen, J.: Die Theorie der regulären graphs (The theory of regular graphs). Acta Math. 15, 193-220 (1891)
6. Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. 22, 107-111 (1947)