Perfect Matching in General vs. Cubic Graphs:A Note on the Planar and Bipartite Cases

• Published in: RAIRO. Informatique théorique et applications Vol. 34; no. 2; pp. 87 - 97
• Main Authors: Bampis, E., Giannakos, A., Karzanov, A., Manoussakis, Y., Milis, I.
• Format: Journal Article
• Language: English
• Published: EDP Sciences 01.03.2000
• Subjects: 05C70; 05C85

It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfect matching in a 3-regular (i.e. cubic) graph. In this paper we extend this result to both, planar and bipartite cases. In particular we prove that the construction problem for perfect matchings in pla...