✦ LIBER ✦

Bipartite matching extendable graphs

✍ Scribed by Xiumei Wang; Zhenkun Zhang; Yixun Lin

Book ID: 108113928
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 353 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced matching extendable graphs

✍ Jinjiang, Yuan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

We say that a simple graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. The main results of this paper are as follows: (1) For every connected IM-extendable graph 2 |V (G)| -2; the equality holds if and only if G ∼

Degree conditions of induced matching ex

Degree conditions of induced matching extendable graphs

✍ Liu Yan; Yuan Jinjiang; Wang Shiying 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 276 KB

On the structure of minimally n-extendab

On the structure of minimally n-extendable bipartite graphs

✍ Dingjun Lou 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 521 KB

It is proved that, in a minimal n-extendable bipartite graph, the subgraph induced by the edges both ends of which have degree at least n + 2 is a forest. As a consequence, every minimal n-extendable bipartite graph has at least 2n + 2 vertices of degree n + 1. This result is sharp. Some other struc

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

Induced matchings in bipartite graphs

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

Extending cycles in bipartite graphs

✍ George R.T Hendry 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 891 KB