✦ LIBER ✦

The number of cycles in 2-factors of cubic graphs

✍ Scribed by Moshe Rosenfeld

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 758 KB
Volume: 84
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90133-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Chords of Longest Cycles in Cubic Graphs

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and

The upper bound of the number of cycles

The upper bound of the number of cycles in a 2-factor of a line graph

✍ Jun Fujisawa; Liming Xiong; Kiyoshi Yoshimoto; Shenggui Zhang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

## Abstract Let __G__ be a simple graph with order __n__ and minimum degree at least two. In this paper, we prove that if every odd branch‐bond in __G__ has an edge‐branch, then its line graph has a 2‐factor with at most ${{3n - 2}\over {8}}$ components. For a simple graph with minimum degree at le

The number of cycles in a hamilton graph

✍ Yongbing Shi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 523 KB

The number of 4-cycles in triangle-free

The number of 4-cycles in triangle-free oriented graphs

✍ Shinsei Tazawa; Chiê Nara; John W. Moon 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Cubicity of interval graphs and the claw

Cubicity of interval graphs and the claw number

✍ Abhijin Adiga; L. Sunil Chandran 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

Let G(V , E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I 1 ×I 2 ×• • •×I b , where each I i is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive in