✦ LIBER ✦

Matchings in graphs II

✍ Scribed by P.J. McCarthy

Book ID: 107748197
Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 680 KB
Volume: 11
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90006-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings in polytopal graphs

✍ B. Grünbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

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.

Random Matchings in Regular Graphs

✍ Jeff Kahn; Jeong Han Kim 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 339 KB

Coloured matchings in bipartite graphs

✍ Kathie Cameron 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A theorem of states that for every n x n (n ~> 3) complete bipartite graph G such that every edge is coloured and each colour is the colour of at most two edges, there is a perfect matching whose edges have distinct colours. We give an O(n 2) algorithm for finding such a perfect matching. We show t

Maximum induced matchings in graphs

✍ Jiping Liu; Huishan Zhou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.

Matchings and walks in graphs

✍ C. D. Godsil 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB

## Abstract The matching polynomial α(__G, x__) of a graph __G__ is a form of the generating function for the number of sets of __k__ independent edges of __G__. in this paper we show that if __G__ is a graph with vertex __v__ then there is a tree __T__ with vertex __w__ such that \documentclass{ar