๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A construction of 3-connected graphs

โœ Scribed by D. W. Barnette


Book ID
112889480
Publisher
The Hebrew University Magnes Press
Year
1994
Tongue
English
Weight
495 KB
Volume
86
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Minimally 3-connected graphs
โœ Robin W Dawes ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 489 KB
Extremal 3-connected graphs
โœ Stephen C. Locke ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 686 KB

Let G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For any three distinct vertices X, y, z there is a path from x to z through y and having length at least M -2. In this paper, we characterize those graphs for which no such path has length exceeding 2d -2. ## I.

Cyclability of 3-connected graphs
โœ Amel Harkat-Benhamdine; Hao Li; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB ๐Ÿ‘ 1 views