𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for a digraph to be Hamiltonian

✍ Scribed by Bang-Jensen, J�rgen; Gutin, Gregory; Li, Hao

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
412 KB
Volume
22
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 of nonadjacent vertices. Our results generalize the classical conditions by Ghouila-Houri and Woodall.

📜 SIMILAR VOLUMES

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

A necessary and sufficient condition for
A necessary and sufficient condition for the star decomposition of complete graphs
✍ Lin, Chiang; Shyu, Tay-Woei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this paper w e prove the following result. Let ml 2 m2 2 ... 2 ml be nonnegative integers. A necessary and sufficient condition for the complete graph K,, to be decomposed into stars S,,, , S