✦ LIBER ✦

The 2-hamiltonian cubes of graphs

✍ Scribed by K. M. Koh; K. L. Teo

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 450 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130609

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

The edge reconstruction of hamiltonian g

The edge reconstruction of hamiltonian graphs

✍ L. Pyber 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 1 views

## Abstract If a graph __G__ on __n__ vertices contains a Hamiltonian path, then __G__ is reconstructible from its edge‐deleted subgraphs for __n__ sufficiently large.

Cube factorizations of complete graphs

✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor

Hamiltonian-laceability of star graphs

✍ Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Line graphs of bipartite graphs with Ham

Line graphs of bipartite graphs with Hamiltonian paths

✍ Francis K. Bell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

It is shown that, if t is an integer !3 and not equal to 7 or 8, then there is a unique maximal graph having the path P t as a star complement for the eigenvalue À2: The maximal graph is the line graph of K m,m if t ¼ 2mÀ1, and of K m,m þ1 if t ¼ 2m. This result yields a characterization of L(G ) wh

Decomposition of complete graphs into 5-

Decomposition of complete graphs into 5-cubes

✍ D. Bryant; S. I. El-Zanati; B. Maenhaut; C. Vanden Eynden 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract Necessary conditions for the complete graph on __n__ vertices to have a decomposition into 5‐cubes are that 5 divides __n__ − 1 and 80 divides __n__(__n__ − 1)/2. These are known to be sufficient when __n__ is odd. We prove them also sufficient for __n__ even, thus completing the spectr