✦ LIBER ✦

Unraveling k-page graphs

✍ Scribed by Ravi Kannan

Book ID: 114037723
Publisher: Elsevier Science
Year: 1985
Weight: 246 KB
Volume: 66
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80008-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

UNRAVELLING TANGLED GRAPHS

✍ FARKAS, CATHERINE; FLAPAN, ERICA; SULLIVAN, WYNN 📂 Article 📅 2012 🏛 World Scientific Publishing Company 🌐 English ⚖ 188 KB

Perfect k-line graphs and k-total graphs

✍ Van Bang Lê 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB 👁 1 views

## Abstract The concept of the line graph can be generalized as follows. The __k__‐line graph __L__~__k__~(__G__) of a graph __G__ is defined as a graph whose vertices are the complete subgraphs on __k__ vertices in __G.__ Two distinct such complete subgraphs are adjacent in __L__~__k__~(__G__) if

Embedding k-Regular Graphs in k + 1-Regu

Embedding k-Regular Graphs in k + 1-Regular Graphs

✍ Gardiner, A. 📂 Article 📅 1983 🏛 Oxford University Press 🌐 English ⚖ 171 KB

Critically (k, k)-connected graphs

✍ Kiyoshi Ando; Yoko Usami 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 359 KB

k-shredders in k-connected graphs

✍ Yoshimi Egawa 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract For a graph __G__, a subset __S__ of __V__(__G__) is called a shredder if __G__ − __S__ consists of three or more components. We show that if __k__ ≥ 4 and __G__ is a __k__‐connected graph, then the number of shredders of cardinality __k__ of __G__ is less than 2|__V__(__G__)|/3 (we sho

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_