✦ LIBER ✦

Maximam critical n-edge connected graph

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 176 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130505

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fragments in 2-Critically n-Connected Gr

Fragments in 2-Critically n-Connected Graphs

✍ J.J. Su 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Mader conjectured that every non-complete \(k\)-critically \(n\)-connected graph has \((2 k+2)\) pairwise disjoint fragments. The conjecture was verified by Mader for \(k=1\). In this paper, we prove that this conjecture holds also for \(k=2\). 1993 Academic Press. Inc.

On k-con-Critically n-Connected Graphs

✍ W. Mader 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We prove that every n-connected graph G of sufficiently large order contains a connected graph H on four vertices such that G À V ðH Þ is ðn À 3Þ-connected. This had been conjectured in Mader (High connectivity keeping sets in n-connected graphs, Combinatorica, to appear). Furthermore, we prove uppe

Super edge connectivity properties of co

Super edge connectivity properties of connected edge symmetric graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

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.

Onk-Critical Connected Line Graphs

✍ Matthias Kriesell 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set. This was conjectured by Maurer and Slater. ## 1998 Academic Press Let }(G) denote the vertex connectivity of a graph G. A set of }(G) vertices which separates G will be called a