✦ LIBER ✦

Cyclability of 3-connected graphs

✍ Scribed by Amel Harkat-Benhamdine; Hao Li; Feng Tian

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 151 KB
Volume: 34
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200007)34:3<191::aid-jgt1>3.0.co;2-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclicity of connected circulant grap

Pancyclicity of connected circulant graphs

✍ Bogdanowicz, Z. R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

On convex embeddings of planar 3-connect

On convex embeddings of planar 3-connected graphs

✍ Kelmans, Alexander 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi

Connected subgraphs with small degree su

Connected subgraphs with small degree sums in 3-connected planar graphs

✍ Enomoto, Hikoe; Ota, Katsuhiro 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) ≤ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

Super edge connectivity properties of co

Super edge connectivity properties of connected edge symmetric graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 1 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Induced paths in 5-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

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.