Hypohamiltonian Graphs and their Crossing Number

descriptionPublicationkeyboard_double_arrow_right Article 25 Oct 2012 Belgium Publisher:The Electronic Journal of CombinatoricsJournal:The Electronic Journal of Combinatorics, volume 19 (eissn: 1077-8926,

Copyright policy )

Authors: Zamfirescu, Carol;

doi: 10.37236/2291

handle: 1854/LU-6901420

Hypohamiltonian Graphs and their Crossing Number

- Summary
- Subjects
- Metrics

Abstract

We prove that for every $k \ge 0$ there is an integer $n_0(k)$ such that, for every $n \ge n_0$, there exists a hypohamiltonian graph which has order $n$ and crossing number $k$.

Country

Belgium

Related Organizations

Ghent University
Belgium
TU Dortmund University
Germany

Keywords

Eulerian and Hamiltonian graphs, Mathematics and Statistics, hypohamiltonian graphs, crossing number, Planar graphs; geometric and topological aspects of graph theory

Impact byBIP!

	selected citations These citations are derived from selected sources. 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).	3
	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).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average