𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two theorems on Hamiltonian graphs

✍ Scribed by A. S. Asratyan; N. K. Khachatryan

Publisher
SP MAIK Nauka/Interperiodica
Year
1984
Tongue
English
Weight
328 KB
Volume
35
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ Ainouche, A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

On two minimax theorems in graph
On two minimax theorems in graph
✍ LΓ‘szlΓ³ LovΓ‘sz πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 400 KB
On hamiltonian line graphs
On hamiltonian line graphs
✍ Lane Clark πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 191 KB
On hamiltonian-connected graphs
On hamiltonian-connected graphs
✍ Ronald J. Gould; Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ β‰… __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

On F-Hamiltonian graphs
On F-Hamiltonian graphs
✍ Zhenqi Yang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 390 KB

Suppose G is a graph, F is a l-factor of G. G is called F-Hamiltonian, if there exists a Hamiltonian cycle containing F in G. In this paper, two necessary and sufficient conditions for a general graph and a bipartite graph being F-Hamiltonian are provided, respectively.