✦ LIBER ✦

Disjoint matchings of graphs

✍ Scribed by Kenneth Lebensold

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 250 KB
Volume: 22
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90066-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighborhood conditions and edge-disjoin

Neighborhood conditions and edge-disjoint perfect matchings

✍ R.J. Faudree; R.J. Gould; L.M. Lesniak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 667 KB

Neighborhood conditions and edge-disjoint perfect matchings, Discrete Mathematics 91 (1991) 33-43. A graph G satisfies the neighborhood condition ANC(G) 2 m if, for all pairs of vertices of G, the union of their neighborhoods has at least m vertices. For a fixed positive integer k, let G be a graph

Collapsible graphs and matchings

✍ Zhi-Hong Chen; Hong-Jian Lai 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ ⊆ __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Matchings in polytopal graphs

✍ B. Grünbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 667 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

Induced matchings in bipartite graphs

✍ R.J. Faudree; A. Gyárfas; R.H. Schelp; Zs. Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 454 KB