𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convex partitions with 2-edge connected dual graphs

✍ Scribed by Marwan Al-Jubeh; Michael Hoffmann; Mashhood Ishaque; Diane L. Souvaine; Csaba D. Tóth

Book ID
106407358
Publisher
Springer US
Year
2010
Tongue
English
Weight
720 KB
Volume
22
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-connectivity in p-partite graphs
Edge-connectivity in p-partite graphs
✍ Lutz Volkmann 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.

Minimally 2-edge connected graphs
Minimally 2-edge connected graphs
✍ G. Chaty; M. Chein 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract A constructive characterization of minimally 2‐edge connected graphs, similar to those of Dirac for minimally 2‐connected graphs is given.

On partitioning the edges of graphs into
On partitioning the edges of graphs into connected subgraphs
✍ M. Jünger; G. Reinelt; W. R. Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

Edge-hamiltonian property in regular 2-
Edge-hamiltonian property in regular 2- connected graphs
✍ Hao Li 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Bill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is hamiltonian. It is shown in this paper that, under almost the same conditions as above, the graphs are edge-hamiltonian.