𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating thec*5-connected graphs

✍ Scribed by David Barnette

Book ID
112885031
Publisher
The Hebrew University Magnes Press
Year
1977
Tongue
English
Weight
365 KB
Volume
28
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generating planar 4-connected graphs
Generating planar 4-connected graphs
✍ David Barnette πŸ“‚ Article πŸ“… 1973 πŸ› The Hebrew University Magnes Press 🌐 English βš– 498 KB
Generating Internally Four-Connected Gra
Generating Internally Four-Connected Graphs
✍ Thor Johnson; Robin Thomas πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 257 KB

A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. A graph G is internally 4-connected if it is simple, 3-connected, has at least five vertices, and if for every partition (A, B) of the edgeset of G, either |A| [ 3 or |B| [ 3 or at least fo

Generating 5-regular planar graphs
Generating 5-regular planar graphs
✍ Guoli Ding; Jinko Kanno; Jianning Su πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 210 KB

## Abstract For __k__=0, 1, 2, 3, 4, 5, let ${\cal{P}}\_{k}$ be the class of __k__ ‐edge‐connected 5‐regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each ${\cal{P}}\_{k}$. Β© 2009 Wiley Periodicals, Inc. J Graph Theory 61: 219–240, 2009

Induced paths in 5-connected graphs
Induced paths in 5-connected graphs
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 75 KB πŸ‘ 2 views

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected.