𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 2-matching lattice of a graph

✍ Scribed by Dieter Jungnickel; Matthias Leclerc

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
135 KB
Volume
46
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

The matching polynomial of a regular gra
The matching polynomial of a regular graph
✍ Robert A. Beezer; E.J. Farrell πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

Perfect matchings of a graph
Perfect matchings of a graph
✍ Ian Anderson πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 179 KB
Matching and covering the vertices of a
Matching and covering the vertices of a random graph by copies of a given graph
✍ Andrzej RuciΕ„ski πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 747 KB

## Rucidski, A., Matching and covering the vertices of a random graph by copies of a given graph, Discrete Mathematics 105 (1992) 185-197. In this paper we partially answer the question: how slowly must p(n) converge to 0 so that a random graph K(n, p) has property PM, almost surely, where PM, me