✦ LIBER ✦

Degree conditions of induced matching extendable graphs

✍ Scribed by Liu Yan; Yuan Jinjiang; Wang Shiying

Book ID: 107500398
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2000
Tongue: English
Weight: 276 KB
Volume: 15
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-000-0001-z

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 ∼

Induced Matching Extendable Graph Powers

✍ Jianguo Qian 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 117 KB

Minmax degree of graphs (Extended abstra

Minmax degree of graphs (Extended abstract)

✍ Clément Charpentier; Mickael Montassier; André Raspaud 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Degree Distance of Unicyclic Graphs with

Degree Distance of Unicyclic Graphs with Given Matching Number

✍ Lihua Feng, Weijun Liu, Aleksandar Ilić, Guihai Yu 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 206 KB

Degree Condition for Subdivisions of Uni

Degree Condition for Subdivisions of Unicyclic Graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 199 KB

Topology of matching, chessboard, and ge

Topology of matching, chessboard, and general bounded degree graph complexes

✍ MichelleL. Wachs 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 531 KB