𝔖 Bobbio Scriptorium
✦   LIBER   ✦

How to make a graph four-connected

✍ Scribed by Ervin Győri; Tibor Jordán

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
92 KB
Volume
84
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

How to make a graph bipartite
How to make a graph bipartite
✍ Paul Erdös; Ralph Faudree; János Pach; Joel Spencer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 678 KB
On Four-Connecting a Triconnected Graph
On Four-Connecting a Triconnected Graph
✍ Tsan-sheng Hsu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 328 KB

We consider the problem of finding a smallest set of edges whose addition four-connects a triconnected graph. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and improving statistical Ž Ž . . database security. We present an O n и ␣ m, n q m -time a

A characterization of weakly four-connec
A characterization of weakly four-connected graphs
✍ Tibor Jordán 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract A graph __G__ = (__V__, __E__) is called weakly four‐connected if __G__ is 4‐edge‐connected and __G__ − __x__ is 2‐edge‐connected for all __x__ ∈ __V__. We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four‐connected graphs. By using thes

Long paths through four vertices in a 2-
Long paths through four vertices in a 2-connected graph
✍ Barovich, Mark V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 2 views

Let G be a 2-connected graph, let u and v be distinct vertices in V (G), and let X be a set of at most four vertices lying on a common (u