𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hypohamiltonian and hypotraceable graphs

✍ Scribed by Carsten Thomassen

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
492 KB
Volume
9
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On hypohamiltonian graphs
On hypohamiltonian graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 996 KB

Rewived 22 January 1974 ct. Herz, Duby and Vigw! [9] wnjectured that every hyguhamiltonian 3 5. In the present note hypohamil tonian graphs of girth 3 and 4 are dewribed. Alsa two con-jectur~s on hypahtimiItoni;in graphs made by Bone@ and Chva"d, respectkply, are disproved. e adopt the notation and

On planar hypohamiltonian graphs
On planar hypohamiltonian graphs
✍ GΓ‘bor Wiener; Makoto Araya πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for eve

A planar hypohamiltonian graph with 48 v
A planar hypohamiltonian graph with 48 vertices
✍ Carol T. Zamfirescu; Tudor I. Zamfirescu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

## Abstract We present a planar hypohamiltonian graph on 48 vertices, and derive some consequences. Β© 2007 Wiley Periodicals, Inc. J Graph Theory 55: 338–342, 2007

Hypotraceable digraphs
Hypotraceable digraphs
✍ Martin GrΓΆtschel; Carsten Thomassen; Yoshiko Wakabayashi πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 233 KB

## Abstract A hypotraceable digraph is a digraph __D__ = (__V, E__) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which __D__ ‐ __v__ is traceable for all __ve__ ∈ __V__. We prove that a hypotraceable digraph of order __n__ exists iff __n__ β‰₯ 7 and that for ea