✦ LIBER ✦

Galaxy cutsets in graphs

✍ Scribed by Nicolas Sonnerat; Adrian Vetta

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 363 KB
Volume: 19
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-009-9258-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Cutsets in ak-connected graph

✍ D. V. Karpov 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 243 KB

Perfect Graphs, Partitionable Graphs and

Perfect Graphs, Partitionable Graphs and Cutsets

✍ Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vušković 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

Small cutsets in quasiminimal Cayley gra

Small cutsets in quasiminimal Cayley graphs

✍ Y.O. Hamidoune; A.S. Lladó; O. Serra 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 586 KB

We continue the recent study carried out by several authors on the cut sets in Cayley graphs with respect to quasiminimal generating sets. We improve the known results on these questions. The application of our main theorem to symmetric Cayley graphs on minimal generating sets leads to the followin

On stable cutsets in line graphs

✍ Van Bang Le; Bert Randerath 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 253 KB

We answer a question of Brandst adt et al. by showing that deciding whether a line graph with maximum degree 5 has a stable cutset is NP-complete. Conversely, the existence of a stable cutset in a line graph with maximum degree at most 4 can be decided e ciently. The proof of our NP-completeness res

Star-cutsets and perfect graphs

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