✦ LIBER ✦

Perfect matchings in planar cubic graphs

✍ Scribed by Maria Chudnovsky, Paul Seymour

Book ID: 118786691
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 256 KB
Volume: 32
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-012-2660-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced matchings in cubic graphs

✍ Peter Horák; He Qing; William T. Trotter 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB

## Abstract In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdös and Nešetřil: For each __d__ ≥ 3, the edge set of a graph of maximum de

On disjoint matchings in cubic graphs

✍ Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Perfect matchings in random intersection

Perfect matchings in random intersection graphs

✍ Bloznelis, Mindaugas; Łuczak, Tomasz 📂 Article 📅 2012 🏛 Akadmiai Kiad 🌐 English ⚖ 579 KB

Perfect Matchings of Cellular Graphs

✍ Mihai Ciucu 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 742 KB

Graphs with independent perfect matching

Graphs with independent perfect matchings

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U. S. R. Murty 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence