𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-Separable Detachments of Graphs

✍ Scribed by Bill Jackson; Tibor Jordán

Book ID
104444310
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
148 KB
Volume
10
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly edge-connected detachments of gra
Highly edge-connected detachments of graphs and digraphs
✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ → __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by ‘splitting’ each vertex ν ∈ __V__ into __r__(ν) vertices. The vertices ν~1~,…,ν~__r__(ν)~ obtained by splitting ν are called the __pieces__ of ν in __H

On separable self-complementary graphs
On separable self-complementary graphs
✍ Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Katsuhiro Ota; Shinsei 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 65 KB
Algorithms on clique separable graphs
Algorithms on clique separable graphs
✍ Fǎnicǎ Gavril 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 925 KB

We define a family of graphs. tailed the clique sepambk graphs. characterized by the fact that they have completely connected rut sets by which we decompose them into r)arts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal gmphs and the i