𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Generalizations of Matching-covered Graphs

✍ Scribed by Zoltán Szigeti

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
184 KB
Volume
22
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching Covered Graphs and Subdivisions
Matching Covered Graphs and Subdivisions ofK4and[formula]
✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph that is an odd subdivision of K 4 or C 6 . It follows immediately that every brick different from K 4 and C 6 has an edge whose removal preserves the matching covered property. These are classical an

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

Total matchings and total coverings of g
Total matchings and total coverings of graphs
✍ Y. Alavi; M. Behzad; L. M. Lesniak-Foster; E. A. Nordhaus 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set

On some subclasses of well-covered graph
On some subclasses of well-covered graphs
✍ Jo Ann W. Staples 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by th

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