✦ LIBER ✦

Maximum induced matching problem on hhd-free graphs

✍ Scribed by Chandra Mohan Krishnamurthy; R. Sritharan

Book ID: 113564679
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 292 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Maximum Induced Matchings in Sub

Finding Maximum Induced Matchings in Subclasses of Claw-Free andP5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size

✍ Daniel Kobler; Udi Rotics 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 489 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.

On maximum induced matchings in bipartit

On maximum induced matchings in bipartite graphs

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

The graphs with maximum induced matching

The graphs with maximum induced matching and maximum matching the same size

✍ Kathie Cameron; Tracy Walker 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Finding a maximum induced matching in we

Finding a maximum induced matching in weakly chordal graphs

✍ Kathie Cameron; R. Sritharan; Yingwen Tang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Finding maximum square-free 2-matchings

Finding maximum square-free 2-matchings in bipartite graphs

✍ David Hartvigsen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 219 KB