✦ LIBER ✦

Intrinsic Chirality of 3-Connected Graphs

✍ Scribed by Erica Flapan; Nikolai Weaver

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 251 KB
Volume: 68
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0066

No coin nor oath required. For personal study only.

✦ Synopsis

We characterize which 3-connected graphs are intrinsically chiral in terms of whether or not a certain type of graph automorphism exists.

📜 SIMILAR VOLUMES

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

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Minimum 3-geodetically connected graphs

✍ Martina Bosı́ková 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A graph G is k-geodetically connected (k-GC) if it is connected and the removal of at least k vertices is required to increase the distance between at least one pair of vertices or reduce G to a single vertex. We completely characterize the class of minimum 3-GC graphs that have the fewest edges for

2-Connected Spanning Subgraphs of Planar

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

✍ D.W. Barnette 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.