✦ LIBER ✦

Perfect Graphs, Partitionable Graphs and Cutsets

✍ Scribed by Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vušković

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 247 KB
Volume: 22
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930200001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star-cutsets and perfect graphs

✍ V Chvátal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Partitionable graphs, circle graphs, and

Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture

✍ Mark A. Buckingham; Martin Charles Golumbic 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Cayley partitionable graphs

✍ A. Pâcher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Antitwins in partitionable graphs

✍ Frédéric Maffray 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Critically partitionable graphs, I

✍ A.G Thomason 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Matching cutsets in graphs

✍ Augustine M. Moshi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

Let G = ( Y E ) be an undirected graph. A subset F of E is a matching cutset of G if no two edges of Fare incident with the same point, and G-F has more components than G. ChGatal [2] proved that it is NP-complete to recognize graphs with a matching cutset even if the input is restricted to graphs w