𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star-cutsets and perfect graphs

✍ Scribed by V Chvátal

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
822 KB
Volume
39
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On slim graphs, even pairs, and star-cut
On slim graphs, even pairs, and star-cutsets
✍ Chính T. Hoàng; Frédéric Maffray 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Hoang, C.T. and F. Maffray, On slim graphs, even pairs, and star-cutsets, Discrete Mathematics 105 (1992) 93-102. Meyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices has at least two chords. A slim graph is any graph obtained from a Meyniel graph by removing

Matching cutsets in graphs
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

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

Isometric cycles, cutsets, and crowning
Isometric cycles, cutsets, and crowning of bridged graphs
✍ Tao Jiang; Seog-Jin Kim; Douglas B. West 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract A graph __G__ is __bridged__ if every cycle __C__ of length at least 4 has vertices __x__,__y__ such that __d__~__G__~(__x__,__y__) < __d__~__C__~(__x__,__y__). A cycle __C__ is __isometric__ if __d__~__G__~(__x__,__y__) = __d__~__C__~(__x__,__y__) for all __x__,__y__ ∈ __V__(__C__). We

Reconstructibility and perfect graphs
Reconstructibility and perfect graphs
✍ Michael Von Rimscha 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 738 KB

It is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs. Furthermor