Geodesic
Hypohamiltonian graphs and their crossing number
Carol T. Zamfirescu1
1TU Dortmund
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/2291
Classification : 05C45, 05C10
Mots-clés : hypohamiltonian graphs, crossing number

Carol T. Zamfirescu  1

1 TU Dortmund 
@article{10_37236_2291,
     author = {Carol T. Zamfirescu},
     title = {Hypohamiltonian graphs and their crossing number},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2291},
     zbl = {1266.05079},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2291/}
}
TY  - JOUR
AU  - Carol T. Zamfirescu
TI  - Hypohamiltonian graphs and their crossing number
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2291/
DO  - 10.37236/2291
ID  - 10_37236_2291
ER  - 
%0 Journal Article
%A Carol T. Zamfirescu
%T Hypohamiltonian graphs and their crossing number
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2291/
%R 10.37236/2291
%F 10_37236_2291
Carol T. Zamfirescu. Hypohamiltonian graphs and their crossing number. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2291

Cité par Sources :