𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minor and minimum cycle bases of a 3-connected planar graph

✍ Scribed by Deng Ju Ma; Han Ren

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2009
Tongue
English
Weight
223 KB
Volume
25
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connected cutsets of a graph and triangl
Connected cutsets of a graph and triangle bases of the cycle space
✍ P Duchet; M Las Vergnas; H Meyniel πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 602 KB

We investigate some properties of graphs whose cycle space has a basis constituted of triangles ('null-homotopic' graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto Ks. These characterizations involve separating subsets and decompos

On cycle bases of a graph
On cycle bases of a graph
✍ M. M. SysΕ‚o πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 358 KB
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

Every longest circuit of a 3-connected,
Every longest circuit of a 3-connected, K3,3-minor free graph has a chord
✍ Etienne BirmelΓ© πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

## Abstract Carsten Thomassen conjectured that every longest circuit in a 3‐connected graph has a chord. We prove the conjecture for graphs having no __K__~3,3~ minor, and consequently for planar graphs. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58: 293–298, 2008