✦ LIBER ✦

Minimally 4-edge# -connected graphs

✍ Scribed by Bernard Peroche; Christine Virlouvet

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 650 KB
Volume: 125
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90170-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 of graphs of order 4 or 5, characterization of graphs with minimum degree 2 and without vertices of degree 3, characterization of quasi-cubic graphs.

📜 SIMILAR VOLUMES

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 (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_

On Minimally (n, λ)-Connected Graphs

✍ Atsushi Kaneko; Katsuhiro Ota 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A graph G is (n, \*)-connected if it satisfies the following conditions: (1) |V(G)| n+1; (2) for any subset S V(G) and any subset L E(G) with \* |S| +|L| <n\*, G&S&L is connected. The (n, \*)-connectivity is a common extension of both the vertex-connectivity and the edge-connectivity. An (n, 1)-conn

Edge-reconstruction of 4-connected plana

Edge-reconstruction of 4-connected planar graphs

✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

A charcterization of 4-edge-connected eu

A charcterization of 4-edge-connected eulerian graphs

✍ Peter Weidl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 594 KB

## Abstract Let __v__ be an arbitrary vertex of a 4‐edge‐connected Eulerian graph __G__. First we show the existence of a nonseparating cycle decompositiion of __G__ with respect to __v__. With the help of this decomposition we are then able to construct 4 edge‐independent spanning trees with the c

Some 3-connected 4-edge-critical non-Ham

Some 3-connected 4-edge-critical non-Hamiltonian graphs

✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

## Abstract Let γ(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if γ (__G__) = k, and for every nonadjacent pair of vertices __u__ and υ, γ(__G__ + __u__υ) = k−1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjectu