✦ LIBER ✦

Induced matchings in intersection graphs

✍ Scribed by Kathie Cameron

Book ID: 108113378
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 208 KB
Volume: 278
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.05.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced Matchings in Intersection Graphs

✍ Kathie Cameron 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Maximum induced matchings in graphs

✍ Jiping Liu; Huishan Zhou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.

Induced matchings in cubic graphs

✍ Peter Horák; He Qing; William T. Trotter 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB

## Abstract In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdös and Nešetřil: For each __d__ ≥ 3, the edge set of a graph of maximum de

Induced matchings in bipartite graphs

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

Improved induced matchings in sparse gra

Improved induced matchings in sparse graphs

✍ Rok Erman; Łukasz Kowalik; Matjaž Krnc; Tomasz Waleń 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 275 KB

On maximum induced matchings in bipartit

On maximum induced matchings in bipartite graphs

✍ V.V. Lozin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB