Abstract
It is known that if an undirected graph G contains a unique perfect matching M, then M contains at least one of bridges of G. In this paper an alternative proof of this statement is presented. The proof is based on the structural theory of acyclic skew-symmetric graphs developed by the author.
Similar content being viewed by others
References
L. Lovász and M. D. Plummer, Applied problems of Graph Theory. Matching Theory in Mathematics, Physics, Chemisdtry (Mir, Moscow, 1998; Matching Theory, Elsevier Science Publishers, Annals of Discrete Mathematics 29, North-Holland, 1986).
A. V. Goldberg and A. V. Karzanov, “Path Problems in Skew-Symmetric Graphs,” Combinatorica 16, 353 (1996).
A. V. Goldberg and A. V. Karzanov, “Maximum skew-symmetric flows and matchings,” Math. Program. 100, 537 (2004).
W. T. Tutte, “Antisymmetrical digraphs,” Can. J. Math. 19, 1101 (1967).
M. A. Babenko, “Acyclic bidirected and skew-symmetric graphs: algorithms and structure,” in Proc. CSR 2006, LNCS 3967, (Springer-Verlag, Berlin, 2006), pp. 23–34.
A. Kotzig, “On the theory of finite graphs with a linear factor I,” Mat.-Fyz. Casopis Slovensk. Akad. Vied. 9, 73 (1959).
Author information
Authors and Affiliations
Additional information
Original Russion Text © M.A. Babenko, 2007, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2007, Vol. 62, No. 2, pp. 65–66.
About this article
Cite this article
Babenko, M.A. An application of the structural theory of acyclic skew-symmetric graphs. Moscow Univ. Math. Bull. 62, 85–86 (2007). https://doi.org/10.3103/S0027132207020076
Received:
Issue Date:
DOI: https://doi.org/10.3103/S0027132207020076