𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some 4-valent, 3-connected, planar, almost pancyclic graphs

✍ Scribed by S.A. Choudum

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
477 KB
Volume
18
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem of J. Zaks concerning 5-val
On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
✍ Stanislav Jendroľ 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Recently J. Zaks formulated the following Eberhard-type problem: Let (Ps, P6 .... ) be a finite sequence of nonnegative integers; does there exist a 5-valent 3-connected planar graph G such that it has exactly Pk k-gons for all k ~> 5, m i of its vertices meet exactly i triangles, 4 ~< i <~ 5, and m

Some 3-connected 4-edge-critical non-Ham
Some 3-connected 4-edge-critical non-Hamiltonian graphs
✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

## Abstract Let γ(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if γ (__G__) = k, and for every nonadjacent pair of vertices __u__ and υ, γ(__G__ + __u__υ) = k−1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjectu

Generating all 3-connected 4-regular pla
Generating all 3-connected 4-regular planar graphs from the octahedron graph
✍ H. J. Broersma; A. J. W. Duijvestijn; F. Göbel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 1 views

## Abstract We prove that all 3‐connected 4‐regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all con

On the edge-reconstruction of 3-connecte
On the edge-reconstruction of 3-connected planar graphs with minimum valency 4
✍ Yue Zhao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the