✦ LIBER ✦

Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs

✍ Scribed by Ferng-Ching Lin; Wei-Kuan Shih

Book ID: 113162947
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 398 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90122-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Removable Edges and Chords of Longest Cy

Removable Edges and Chords of Longest Cycles in 3-Connected Graphs

✍ Jichang Wu, Hajo Broersma, Haiyan Kang 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 201 KB

Nonseparating Induced Cycles Consisting

Nonseparating Induced Cycles Consisting of Contractible Edges in k -Connected Graphs

✍ Egawa, Yoshimi; Inoue, Katsumi; Kawarabayashi, Ken-ichi 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 175 KB

Long paths and cycles in subgraphs of th

Long paths and cycles in subgraphs of the cube

✍ E. Long 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 810 KB

Complexity Issues in VLSI--Optimal Layou

Complexity Issues in VLSI--Optimal Layouts for the Shuffle-Exchange Graph and Other Networks.by Frank Thomson Leighton

✍ Review by: Wayne Wolf 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 317 KB

Long Cycles and 3-Connected Spanning Sub

Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs

✍ B. Jackson; N.C. Wormald 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Let \(G\) be a 3-connected \(K_{1, d}\)-free graph on \(n\) vertices. We show that \(G\) contains a 3-connected spanning subgraph of maximum degree at most \(2 d-1\). Using an earlier result of ours, we deduce that \(G\) contains a cycle of length at least \(\frac{1}{2} n^{c}\) where \(c=\left(\log

On the Longest Cycles in a Class of 3-Co

On the Longest Cycles in a Class of 3-Connected Graphs

✍ CHUANPING CHEN; YONGJIN ZHU 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 462 KB