𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for a graph to be hamiltonian

✍ Scribed by Norbert Köhler

Publisher
Springer Vienna
Year
1981
Tongue
English
Weight
535 KB
Volume
92
Category
Article
ISSN
0026-9255

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

A sufficient condition for a semicomplet
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
✍ Jørgen Bang-Jensen; Gregory Gutin; Jing Huang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 670 KB

A multipartite tournament is an orientation of a complete k-partite graph for some k >~ 2. A factor of a digraph D is a collection of vertex disjoint cycles covering all the vertices of D. We show that there is no degree of strong connectivity which together with the existence of a factor will guara