Tight bounds on maximal and maximum matchings

Discrete Mathematics

Volumn 285, Issue 1-3, 2004, Pages 7-15

  Biedl, Therese ^a   Demaine, Erik D ^b   Duncan, Christian A ^c   Fleischer, Rudolf ^d   Kobourov, Stephen G ^e  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Department of Computer Science and Center for Computational Science   (United States)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^e University of Arizona   (United States)

Author keywords

Bounded maximum degree; Bounds; Matching; Planar graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; PROBLEM SOLVING; THEOREM PROVING;

BIPARTITE GRAPH; MAXIMUM MATCHING; PERFECT MATCHING; PLANAR GRAPH;

GRAPH THEORY;

EID: 3142607299     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.05.003     Document Type: Article

References (13)

1. Berge C. Two theorems in graph theory. Proc. Nat. Acad. Sci. USA. 43:1957;842-844.
2. Biedl T., Bose P., Demaine E., Lubiw A. Efficient algorithms for Petersen's theorem. J. Algorithms. 38:2001;110-134.
3. Cole R., Ost K., Schirra S. Edge-coloring bipartite multigraphs in. O(E log D) time Combinatorica. 21(1):2001;5-12.
4. C. Duncan, M. Goodrich, S. Kobourov, Planarity-preserving clustering and embedding for large planar graphs, Graph Drawing (GD'99), Lecture Notes in Computer Science, Vol. 1731, Springer, Berlin, New York, 1999, pp. 186-196.
5. Hall P. On representation of subsets. J. London Math. Soc. 10:1935;26-30.
6. 5/2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2:1973;225-231.
7. König D. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77:1916;453-465.
8. S. Micali, V.V. Vazirani, An O( |V| ·|E|) algorithm for finding maximum matching in general graphs, in: 21st Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers Inc. (IEEE), New York, 1980, pp. 17-27.
9. Nishizeki T., Baybars I. Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3):1979;255-267.
10. Petersen J. Die Theorie der regulären graphs. (The theory of regular graphs) Acta Math. 15:1891;193-220.
11. Schrijver A. Bipartite edge coloring in. O(Δ m) time SIAM J. Comput. 28(3):1999;841-846.
12. Tutte W.T. The factorization of linear graphs. J. London Math. Soc. 22:1947;107-111.
13. Tutte W.T. Bridges and Hamiltonian circuits in planar graphs. Aequationes Math. 15(1):1977;1-33.