✦ LIBER ✦

Hamiltonian threshold graphs

✍ Scribed by Frank Harary; Uri Peled

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 258 KB
Volume: 16
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90050-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian threshold for strong product

Hamiltonian threshold for strong products of graphs

✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We prove that the strong product of any at least ${({\rm ln}}\, {2})\Delta+{O}(\sqrt{\Delta})$ non‐trivial connected graphs of maximum degree at most Δ is pancyclic. The obtained result is asymptotically best possible since the strong product of ⌊(ln 2)__D__⌋ stars __K__~1,__D__~ is not

Directed hamiltonian graphs

✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

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

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 pancyclic graphs

✍ Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 79 KB

Box-threshold graphs

✍ Uri N. Peled; Bruno Simeone 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 608 KB

A graph is called box-threshold when all pairs of vertices with incomparable neighborhoods have the same degree. Several properties of box-threshold graphs, generalizing properties of threshold graphs, are proved. A transportation model with priority constraints is used to characterize their degree