✦ LIBER ✦

Toughness and matching extension in graphs

✍ Scribed by M.D. Plummer

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 588 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90221-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binding number and toughness for matchin

Binding number and toughness for matching extension

✍ Ciping Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 157 KB

A graph G of even order is said to be k-extendable if every matching of size k in G can be extended to a 1-factor of G. Plummet (1988) showed that a graph G is k-extendable if tough (G) > k, and we here prove that G is also k-extendable if bind(G) > max {k, (7k + 13)/12}.

Matching extension in the powers ofn-con

Matching extension in the powers ofn-connected graphs

✍ Walcher, Kara Lee 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

Let G be a graph on p vertices. Then for a positive integer n, G is said to be n-extendible if (i) TI < p / 2 , iii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is TIconnected, then Gk is ([$

Matching extension and the genus of a gr

Matching extension and the genus of a graph

✍ Michael D Plummer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Matching graphs

✍ Eroh, Linda; Schultz, Michelle 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

The matching graph M (G) of a graph G is that graph whose vertices are the maximum matchings in G and where two vertices M 1 and M 2 of M (G) this graph models a metric space whose metric is defined on the set of maximum matchings in G. Which graphs are matching graphs of some graph is not known in

Matching cutsets in graphs

✍ Augustine M. Moshi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

Let G = ( Y E ) be an undirected graph. A subset F of E is a matching cutset of G if no two edges of Fare incident with the same point, and G-F has more components than G. ChGatal [2] proved that it is NP-complete to recognize graphs with a matching cutset even if the input is restricted to graphs w

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