Name
Abstract | ||
|---|---|---|
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 every integer n≥N there exists a planar hypohamiltonian/hypotraceable graph on n vertices. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 55-68, 2011 © 2011 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1002/jgt.20513 | Journal of Graph Theory |
Keywords | Field | DocType |
positive integer,open problem,n vertex,wiley periodicals,inc. j graph theory,planar hypohamiltonian graph,planar hypohamiltonian,integer n,planar hypotraceable graph,hypotraceable graph,graph,hamiltonian | Graph theory,Discrete mathematics,Topology,Wheel graph,Combinatorics,Outerplanar graph,Graph power,Level structure,Coxeter graph,Hypohamiltonian graph,Butterfly graph,Mathematics | Journal |
Volume | Issue | ISSN |
67 | 1 | 0364-9024 |
Citations | PageRank | References |
8 | 0.68 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Wiener | 1 | 64 | 10.65 |
| Makoto Araya | 2 | 26 | 8.52 |