✦ LIBER ✦

Countable α-extendable graphs

✍ Scribed by Jean-Luc Rullière; Stéphan Thomassé

Book ID: 108315590
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 222 KB
Volume: 239
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00374-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path extendable graphs

✍ G. R. T. Hendry 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 666 KB

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 ∼

Bipartite matching extendable graphs

✍ Xiumei Wang; Zhenkun Zhang; Yixun Lin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Endpoint extendable paths in dense graph

Endpoint extendable paths in dense graphs

✍ Guantao Chen; Zhiquan Hu; Hao Li 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Removable ears of 1-extendable graphs

✍ Shaohui Zhai; Xiaofeng Guo 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 200 KB

On 2-extendable abelian Cayley graphs

✍ Onn Chan; C.C. Chen; Qinglin Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 737 KB

A graph G is 2-extendable if any two independent edges of G are contained in a perfect matching of G. A Cayley graph of even order over an abelian group is 2-extendable if and only if it is not isomorphic to any of the following circulant graphs: (I) Z2.(1,2n -1), n >~ 3; (II) ZE.(1,2,2n -1,2n -2),