✦ LIBER ✦

Directed hamiltonian graphs

✍ Scribed by Yannis Manoussakis

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 386 KB
Volume: 16
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190160106

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

📜 SIMILAR VOLUMES

Hamiltonian line graphs

✍ Richard A. Brualdi; Robert F. Shanny 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

## Abstract Sufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.

Hamiltonian path graphs

✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia

Hamiltonian groups are color-graph-hamil

Hamiltonian groups are color-graph-hamiltonian

✍ Joseph B. Klerlein; A. Gregory Starling 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

## Abstract A group Γ is said to be color ‐graph ‐hamiltonian if Γ has a minimal generating set Δ such that the Cayley color graph __D__~Δ~(Γ) is hamiltonian. It is shown that every hamiltonian group is color ‐graph ‐hamiltonian.

Hamiltonian ?-factors in graphs

✍ Wei, Bing; Zhu, Yongjin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

Let k ≥ 2 be an integer. A k-factor F of a graph G is called a hamiltonian k-factor if F contains a hamiltonian cycle. In this paper, we shall prove that if G is a graph of order n with k ≥ 2, n ≥ 8k -4, kn even and δ(G) ≥ n/2, then G has a hamiltonian k-factor.

Onk-ordered Hamiltonian graphs

✍ Kierstead, H. A.; S�rk�zy, G. N.; Selkow, S. M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine

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