𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian orthogeodesic alternating paths

✍ Scribed by Di Giacomo, Emilio; Grilli, Luca; Krug, Marcus; Liotta, Giuseppe; Rutter, Ignaz


Book ID
119292779
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
597 KB
Volume
16
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Hamiltonian Square-Paths
✍ Genghua Fan; H.A Kierstead πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 425 KB

A hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joining every pair of vertices of distance two in the path (cycle). Let G be a graph on n vertices with minimum degree $(G). Posa and Seymour conjectured that if $(G) 2 3 n, then G contains a hamiltonian square-cy

Alternating Hamiltonian cycles
✍ BΓ©la BollobΓ‘s; Paul ErdΓΆs πŸ“‚ Article πŸ“… 1976 πŸ› The Hebrew University Magnes Press 🌐 English βš– 259 KB
Hamiltonian paths and hamiltonian connec
✍ Bing Wei πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 388 KB

## Let G be a 2-connected graph with n vertices such that d(u)+d(u)+d(w)-IN(u)nN(u)nN(w)I an+ 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and u such that {u, 0) is not a cut vertex set of G, there is a hamiltonian path between u and o. In particular,

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

The method of alternating paths
✍ W. T. Tutte πŸ“‚ Article πŸ“… 1982 πŸ› Springer-Verlag 🌐 English βš– 476 KB