✦ LIBER ✦

Connected Detachments of Graphs and Generalized Euler Trails

✍ Scribed by Nash-Williams, C. S. J. A.

Book ID: 120095466
Publisher: Oxford University Press
Year: 1985
Tongue: English
Weight: 314 KB
Volume: s2-31
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-31.1.17

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

Finding Double Euler Trails of Planar Gr

Finding Double Euler Trails of Planar Graphs in Linear Time

✍ Chen, Zhi-Zhong; He, Xin; Huang, Chun-Hsi 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 396 KB

Detachment of Vertices of Graphs Preserv

Detachment of Vertices of Graphs Preserving Edge-Connectivity

✍ Fleiner, Balázs 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 180 KB

Generalized handles in graphs and connec

Generalized handles in graphs and connected sums of manifolds

✍ Alberto Cavicchioli 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 563 KB

On the Euler genus of a 2-connected grap

On the Euler genus of a 2-connected graph

✍ R.Bruce Richter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Parallel computation of the Euler number

Parallel computation of the Euler number via Connectivity Graph

✍ Franco Chiavetta; Vito Di Gesù 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 583 KB