✦ LIBER ✦

The Number of Removable Edges in 3-Connected Graphs

✍ Scribed by Su Jianji

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 147 KB
Volume: 75
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1864

No coin nor oath required. For personal study only.

✦ Synopsis

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 five, except the wheels W 5 and W 6 , has at least (3 |G| +18)Â7 removable edges. We also characterize the graphs with (3 |G| +18)Â7 removable edges.

📜 SIMILAR VOLUMES

Removable edges in 3-connected graphs

✍ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB

## Abstract An edge __e__ of a 3‐connected graph __G__ is said to be __removable__ if __G__ ‐ __e__ is a subdivision of a 3‐connected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3‐connected graphs and pr

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

Contractible Non-edges in 3-Connected Gr

Contractible Non-edges in 3-Connected Graphs

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

We present a reduction theorem for the class of all finite 3-connected graphs which does not make use of the traditional contraction of certain connected subgraphs. ## 1998 Academic Press Contractible edges play an important role in the theory of 3-connected graphs. Besides the famous wheel theore

The number of connected sparsely edged g

The number of connected sparsely edged graphs. IV large nonseparable graphs

✍ E. M. Wright 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB

The number of nonseparable graphs on n labeled points and q lines is u(n, 9). In the second paper of this series an exact formula for u(n, n + k) was found for general n and successive (small) k. The method would give an asymptotic approximation for fixed k as n + 30. Here an asymptotic approximatio

The number of connected sparsely edged g

The number of connected sparsely edged graphs. II. Smooth graphs and blocks

✍ E. M. Wright 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

A smooth graph is a connected graph without endpoints; f (n, q ) is the number of connected graphs, v(n, q ) is the number of smooth graphs, and u(n, q) is the number of blocks on n labeled points and q edges: wk, V,, and u k are the exponential generating functions of f(n, n + k ) , v(n, n + k). an

The number of connected sparsely edged g

The number of connected sparsely edged graphs. III. Asymptotic results

✍ E. M. Wright 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## Abstract The number of connected graphs on __n__ labeled points and __q__ lines (no loops, no multiple lines) is __f(n,q).__ In the first paper of this series I showed how to find an (increasingly complicated) exact formula for __f(n,n+k)__ for general __n__ and successive __k.__ The method woul