The two ear theorem on matching-covered graphs (Q1127879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1186395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two ear theorem on matching-covered graphs |
scientific article; zbMATH DE number 1186395 |
Statements
The two ear theorem on matching-covered graphs (English)
0 references
14 December 1998
0 references
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.
0 references
matchings
0 references
ear-decomposition
0 references
0 references
0.8342359066009521
0 references
0.8290276527404785
0 references
0.8125634789466858
0 references
