✦ LIBER ✦

The classification of hamiltonian generalized Petersen graphs

✍ Scribed by Brian Alspach

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 689 KB
Volume: 34
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90042-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of Hamiltonian cycles in cer

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs

✍ Allen J Schwenk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the 2-extendability of the generalize

On the 2-extendability of the generalized Petersen graphs

✍ Gerald Schrag; Larry Cammack 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 731 KB

A graph G is n-extendable if it is connected, contains a set of rr independent edges and every set of n-independent edges extends to (i.e. is a subset of) a perfect matching. Combining the results of this and previous papers we answer the question of 2-extendability for all the generalized Petersen

On the crossing numbers of certain gener

On the crossing numbers of certain generalized Petersen graphs

✍ Dan McQuillan; R. Bruce Richter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 484 KB

In his paper on the crossing numbers of generalized Petersen graphs, Fiorini proves that P(8, 3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the second claim is false. The techniques are

A Note on the Generalized Petersen Graph

A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs

✍ Marko Lovrečič Saražin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 483 KB

The aim of this note is to present a short proof of a result of Nedela and S8 koviera (J. Graph Theory 19 (1995, 1 11)) concerning those generalized Petersen graphs that are also Cayley graphs. In that paper the authors chose the heavy weaponry of regular maps on closed connected orientable surfaces

Hyper hamiltonian laceability of Cayley

Hyper hamiltonian laceability of Cayley graphs generated by transpositions

✍ Toru Araki 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

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