𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for a graph to be Hamiltonian

✍ Scribed by S Goodman; S Hedetniemi

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
330 KB
Volume
16
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A necessary and sufficient condition for
A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
✍ Zhou Huai-Lu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 272 KB πŸ‘ 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,

Sufficient conditions for a digraph to b
Sufficient conditions for a digraph to be Hamiltonian
✍ Bang-Jensen, JοΏ½rgen; Gutin, Gregory; Li, Hao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 412 KB πŸ‘ 2 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs

One sufficient condition for hamiltonian
One sufficient condition for hamiltonian graphs
✍ Guantao Chen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 220 KB πŸ‘ 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.

Four sufficient conditions for hamiltoni
Four sufficient conditions for hamiltonian graphs
✍ A. Ainouche πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 290 KB

## Ainouche, A., Four sufficient conditions for hamiltonian graphs, Discrete Mathematics 89 (1991) 195-200.