𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Splitting off edges between two subsets preserving the edge-connectivity of the graph

✍ Scribed by Jørgen Bang-Jensen; Tibor Jordán

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
441 KB
Volume
276
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Splitting Off Edges within a Specified S
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
✍ Jørgen Bang-Jensen; Tibor Jordán 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Splitting off a pair su sv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = V + s E which is kedge-connected (k ≥ 2) between vertices of V and a specified subset R ⊆ V , first we consider the problem of finding a longest possible sequence of

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^n−2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

The Number of Removable Edges in 3-Conne
The Number of Removable Edges in 3-Connected Graphs
✍ Su Jianji 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

An edge of a 3-connected graph G is said to be removable if G&e is a subdivision of a 3-connected graph. Holton et al. (1990) proved that every 3-connected graph of order at least five has at least W(|G| +10)Â6X removable edges. In this paper, we prove that every 3-connected graph of order at least