𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ear Decompositions of Matching Covered Graphs

✍ Scribed by Marcelo H. Carvalho; Cláudio L. Lucchesi; U. S. R. Murty

Book ID
106167835
Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
315 KB
Volume
19
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Ear Decompositions of Matching C
Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice
✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A Petersen brick is a graph whose underlying simple graph is isomorphic to the Petersen graph. For a matching covered graph G, b(G) denotes the number of bricks of G, and p(G) denotes the number of Petersen bricks of G. An ear decomposition of G is optimal if, among all ear decompositions of G, it u

Circuit decompositions of join-covered g
Circuit decompositions of join-covered graphs
✍ Marcelo H. de Carvalho; C. H. C. Little 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract In this paper, we focus our attention on join‐covered graphs, that is, ±1‐weighted graphs, without negative circuits, in which every edge lies in a zero‐weight circuit. Join covered graphs are a natural generalization of matching‐covered graphs. Many important properties of matching cov