The two ear theorem on matching-covered graphs
type: Item
instance of: scholarly article
title: The two ear theorem on matching-covered graphs
zbMATH Open document ID: 0904.05073
author: Zoltán Szigeti
published in: Journal of Combinatorial Theory. Series B
publication date: 1998-12-14T00:00:00Z
review text: We give a simple and short proof for the two ear theorem on matching-covered graphs which is a well-known result of Lovász and Plummer. The proof relies only on the classical results of Tutte and Hall on perfect matchings in (bipartite) graphs.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1186395
zbMATH Keywords: matchings
zbMATH Keywords: ear-decomposition
MaRDI profile type: Publication
full work available at URL: jctb.1998.1824
OpenAlex ID: W2136039996
cites work: Perfect matchings of a graph
cites work: Ear decompositions of matching covered graphs
cites work: On Representatives of Subsets
cites work: Spectrum and principal functions of the non-self-adjoint Sturm-Liouville operators with a singular potential
cites work: On the structure of factorizable graphs
cites work: Q4065587
cites work: Matching theory
cites work: Q3826614
cites work: The Factorization of Linear Graphs
DOI: 10.1006/JCTB.1998.1824
description: scientific article; zbMATH DE number 1186395