𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The circumference of the square of a connected graph

✍ Scribed by Brandt, Stephan; Müttel, Janina; Rautenbach, Dieter

Book ID
125348555
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
347 KB
Volume
34
Category
Article
ISSN
0209-9683

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

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

Forbidden subgraphs and hamiitonian prop
Forbidden subgraphs and hamiitonian properties in the square of a connected graph
✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB 👁 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the