๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Induced Matching Extendable Graph Powers

โœ Scribed by Jianguo Qian


Book ID
106047618
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
117 KB
Volume
22
Category
Article
ISSN
0911-0119

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 โˆผ

Bipartite matching extendable graphs
โœ Xiumei Wang; Zhenkun Zhang; Yixun Lin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 353 KB
Extending matchings in claw-free graphs
โœ Michael D. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 506 KB

Let G be a graph with a perfect matching and let n be an integer, has a perfect matching for every pair of points u and v in V(G). It is proved that every 3-connected claw-free graph is bicritical and for n>2, every (2n+ l)-connected claw-free graph is n-extendable. Matching extension in planar an

Extending matchings in planar graphs IV
โœ Michael D. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 973 KB

Plummer, M.D., Extending matchings in planar graphs IV, Discrete Mathematics 109 (1992) 207-219. The structure of certain non-Zextendable planar graphs is studied first. In particular, 4-connected S-regular planar graphs which are not 2-extendable are investigated and examples of these are presented

Extending matchings in planar graphs V
โœ Michael D. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 473 KB

A graph G on at least 2n + 2 vertices in n-extendable if every set of n independent edges extends to (i.e., is a subset of) a perfect matching in G. It is known that no planar graph is 3-extendable. In the present paper we continue to study 2-extendability in the plane. Suppose independent edges el