Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T01:05:09.073Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  15 April 2002

E. Bampis
Affiliation:
LaMI, Université d'Evry, boulevard des Coquibus, 91025 Evry Cedex, France; (bampis@lami.univ-evry.fr)
A. Giannakos
Affiliation:
La.R.I.A., Université de Picardie-Jules Verne, 5 rue du Moulin Neuf, 80000 Amiens, France; (aristote@laria.u-picardie.fr)
A. Karzanov
Affiliation:
Institute for System Analysis, 9, Prosp. 60 Let Octyabrya, 117312 Moscow, Russia.
Y. Manoussakis
Affiliation:
LRI, bâtiment 490, Université Paris-Sud, 91405 Orsay Cedex, France; (yannis@lri.fr)
I. Milis
Affiliation:
Athens University of Economics and Business, Department of Informatics, 76 Patission St., 10434 Athens, Greece; (milis@aueb.gr)
Get access

Abstract

It is known that finding a perfect matching in a general graph is AC 0-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 planar graphsis as difficult as in the case of planar cubic graphs like it is known to be the case for the famous Map Four-Coloring problem. Moreover we prove that the existence and construction problems for perfect matchings in bipartite graphs are as difficult as the existence and construction problems for a weighted perfect matching of O(m) weight in a cubic bipartite graph.

Keywords

Information

Type
Research Article
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable