✦ LIBER ✦

On the Circumference of 2-Connected(mathcal{P}_{3})-Dominated Graphs

✍ Scribed by Jiangyan Guo; Elkin Vumar

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 157 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0805-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Circumferences of Regular 2-Conne

On the Circumferences of Regular 2-Connected Graphs

✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nÂ(r&1) if n is large enough. In this paper, we show that c(G) 2nÂ(r&1)+2(r&3)Â(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu

On the Circumference of 3-Connected Quas

On the Circumference of 3-Connected Quasi-Claw-Free Graphs

✍ Elkin Vumar 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 152 KB

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

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

On the Structure of 3-connected Matroids

On the Structure of 3-connected Matroids and Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne

On the Number of Cycles in 3-Connected C

On the Number of Cycles in 3-Connected Cubic Graphs

✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie