✦ LIBER ✦

On perfectly two-edge connected graphs

✍ Scribed by Ali Ridha Mahjoub

Book ID: 104113627
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 1009 KB
Volume: 170
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00004-0

No coin nor oath required. For personal study only.

✦ Synopsis

This paper studies the graphs for which the 2-edge connected spanning subgraph polytope is completely described by the trivial inequalities and the so-called cut inequalities. These graphs are called perfectly 2-edge connected. The class of perfectly 2-edge connected graphs contains for instance the class of series-parallel graphs. We introduce a new class of perfectly 2-edge connected graphs. We discuss some structural properties of graphs which are (minimally with respect to some reduction operations) nonperfectly 2-edge connected. Using this we give sufficient conditions for a graph to be perfectly 2-edge connected.

📜 SIMILAR VOLUMES

On 3-Edge-Connected Supereulerian Graphs

✍ Hong-Jian Lai; Hao Li; Yehong Shao; Mingquan Zhan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 222 KB

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB

Minimally restricted edge connected grap

Minimally restricted edge connected graphs

✍ Yanmei Hong; Qinghai Liu; Zhao Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 176 KB

For a connected graph G = (V, E), an edge set S ⊂ E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by λ (G). , where ξ(G) is the minimum edge degree of

Minimally 4-edge# -connected graphs

✍ Bernard Peroche; Christine Virlouvet 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 650 KB

In this article, we deal with a connectivity problem stated by Maurer and Slater to characterize minimally k-edge'-connected graphs. This problem has been solved for k = 1,2 and 3, and we recall herein the results obtained. Then we give some partial results concerning the case k =4: representation o

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.

MINIMALLY 2-EDGE-CONNECTED GRAPHS

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB