Name
Abstract | ||
|---|---|---|
The number of crossing-free Hamiltonian circuits in planar drawings of Kn is studied. In particular, it is shown that for planar drawings of Kn, (1) there are drawings having as many as (320)·10[n3] such circuits and (2) no drawing contains more than 2·6n−2([n2])! |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0095-8956(80)90041-6 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Hamiltonian (quantum mechanics),Hamiltonian path,Planar,Electronic circuit,Mathematics | Journal | 29 |
Issue | ISSN | Citations |
1 | 0095-8956 | 14 |
PageRank | References | Authors |
2.08 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Monroe M. Newborn | 1 | 177 | 47.49 |
| W.O.J. Moser | 2 | 19 | 4.02 |