𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar cubic hypohamiltonian and hypotraceable graphs

✍ Scribed by Carsten Thomassen

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
473 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Properties of a planar cubic graph
Properties of a planar cubic graph
✍ Shunichi Toida πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 506 KB

It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.