Ear decompositions of matching covered graphs
type: Item
instance of: scholarly article
title: Ear decompositions of matching covered graphs
zbMATH Open document ID: 0929.05064
author: U. S. R. Murty
author: Marcelo H. de Carvalho
author: Cláudio L. Lucchesi
published in: Combinatorica
publication date: 1999-12-08T00:00:00Z
review text: 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.
reviewed by: Péter Komjáth
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1376202
zbMATH Keywords: ear decomposition
zbMATH Keywords: matching covered graphs
MaRDI profile type: Publication
full work available at URL: s004930050051
OpenAlex ID: W2009268323
DOI: 10.1007/S004930050051
description: scientific article; zbMATH DE number 1376202