𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decompositions and Connectivity of Matching and Chessboard Complexes

✍ Scribed by Christos A. Athanasiadis

Publisher
Springer
Year
2004
Tongue
English
Weight
148 KB
Volume
31
Category
Article
ISSN
0179-5376

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