✦ LIBER ✦

Convex Programming and Circumference of 3-Connected Graphs of Low Genus

✍ Scribed by Zhicheng Gao; Xingxing Yu

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 376 KB
Volume: 69
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.1719

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree bounds for the circumference of 3

Degree bounds for the circumference of 3-connected graphs

✍ Heinz A. Jung; Elkin Vumar 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract Let __C__ be a longest cycle in the 3‐connected graph __G__ and let __H__ be a component of __G__ − __V__(__C__) such that |__V__(__H__)| ≥ 3. We supply estimates of the form |__C__| ≥ 2__d__(__u__) + 2__d__(__v__) − α(4 ≤ α ≤ 8), where __u__,__v__ are suitably chosen non‐adjacent verti

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

Cyclability of 3-connected graphs

✍ Amel Harkat-Benhamdine; Hao Li; Feng Tian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Codiameters of 3-connected 3-domination

Codiameters of 3-connected 3-domination critical graphs

✍ Yaojun Chen; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract A graph __G__ is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let __G__ be a 3‐connected 3‐domination critical graph of order __n__. In this paper, we show that there is a path of length at least __n__−2 between any two distinct ve

2-connected 7-coverings of 3-connected g

2-connected 7-coverings of 3-connected graphs on surfaces

✍ Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Katsuhiro Ota 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract An __m__‐__covering__ of a graph __G__ is a spanning subgraph of __G__ with maximum degree at most __m__. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus __k__ ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most

Critical graphs for subpancyclicity of 3

Critical graphs for subpancyclicity of 3-connected claw-free graphs

✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## Abstract Let ${\cal{F}}\_{k}$ be the family of graphs __G__ such that all sufficiently large __k__ ‐connected claw‐free graphs which contain no induced copies of __G__ are subpancyclic. We show that for every __k__≥3 the family ${\cal{F}}\_{1}k$ is infinite and make the first step toward the c