Name
Abstract | ||
|---|---|---|
. There is only one finite, 2-connected, linearly convex graph in the Archimedean triangular tiling that does not have a Hamiltonian
cycle. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/s004540010051 | Discrete & Computational Geometry |
Keywords | Field | DocType |
hamiltonian cycle | Covariant Hamiltonian field theory,Superintegrable Hamiltonian system,Topology,Graph,Combinatorics,Hamiltonian (quantum mechanics),Hamiltonian path,Good quantum number,Regular polygon,Hamiltonian path problem,Mathematics | Journal |
Volume | Issue | ISSN |
24 | 2-3 | 0179-5376 |
Citations | PageRank | References |
3 | 0.43 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John R. Reay | 1 | 22 | 5.99 |
| Tudor Zamfirescu | 2 | 77 | 16.85 |