
AbstractUpper and lower bounds for the crossing number of the graph formed by deletion of a hamilton circuit from the complete graph on n vertices are obtained, with exact values for n≤10 and for the rectilinear crossing number for n≤9.
Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
