✦ LIBER ✦

Minimum K-hamiltonian graphs

✍ Scribed by W. W. Wong; C. K. Wong

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 401 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-ordered Hamiltonian graphs

✍ Ng, Lenhard; Schultz, Michelle 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

A hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v 1 , v 2 , . . . , v k of k distinct vertices of G, there exists a hamiltonian cycle that encounters v 1 , v 2 , . . . , v k in this order. Theorems by Dirac and Ore, presenting sufficient conditions for a graph to be h

On minimum degree in Hamiltonian path gr

On minimum degree in Hamiltonian path graphs

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

Towards minimum k-geodetically connected

Towards minimum k-geodetically connected graphs

✍ Ján Plesník 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

Degree conditions for k-ordered hamilton

Degree conditions for k-ordered hamiltonian graphs

✍ Ralph J. Faudree; Ronald. J. Gould; Alexandr V. Kostochka; Linda Lesniak; Ingo S 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract For a positive integer __k__, a graph __G__ is __k‐ordered hamiltonian__ if for every ordered sequence of __k__ vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if __G__ is a graph of order __n__ with 3 ≤ __k__ ≤ __n

Hamiltonian results in K1,3-free graphs

✍ M. M. Matthews; D. P. Sumner 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB 👁 1 views

There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K,,,-free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K,.3-free gra

Kneser Graphs Are Hamiltonian For n⩾3k

✍ Ya-Chen Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB

The Kneser graph K(n, k) has as vertices the k-subsets of [1, 2, ..., n]. Two vertices are adjacent if the k-subsets are disjoint. In this paper, we prove that K(n, k) is Hamiltonian for n 3k, and extend this to the bipartite Kneser graphs.