Ear decompositions of matching covered graphs (Q1125615): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004930050051 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009268323 / rank | |||
Normal rank | |||
Revision as of 14:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ear decompositions of matching covered graphs |
scientific article |
Statements
Ear decompositions of matching covered graphs (English)
0 references
8 December 1999
0 references
Using the dependence relation introduced by the first two authors, simple proofs are given to several theorems on ear decompositions, for example, that any matching covered graph different from \(K_2\) and \(C_{2n}\) has \(\Delta\)(=maximum degree) edge disjoint removable ears. Every brick different from \(K_4\) and \(\overline{C_6}\) has at least \(\Delta-2\) removable edges. Every nonbipartite matching covered graph has an optimal ear decomposition (i.e., with a minimal number of double ears) which is canonical.
0 references
ear decomposition
0 references
matching covered graphs
0 references
