𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Two Ear Theorem on Matching-Covered Graphs

✍ Scribed by Zoltán Szigeti

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
150 KB
Volume
74
Category
Article
ISSN
0095-8956

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

On a Conjecture of Lovász Concerning Bri
On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph
✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 292 KB

In 1987, Lova ´sz conjectured that every brick G different from K 4 , C ¯6, and the Petersen graph has an edge e such that G -e is a matching covered graph with exactly one brick. Lova ´sz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and i

A note on the cover degeneracy of graphs
A note on the cover degeneracy of graphs
✍ Li Zhang; Baoyindureng Wu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

## Abstract We give a 4‐chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by Böhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh