Geodesic
The minor crossing number of graphs with an excluded minor
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The minor crossing number of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at most $c|V(G)|$.
DOI : 10.37236/728
Classification : 05C10, 05C83 
@article{10_37236_728,
     author = {Drago Bokal and Ga\v{s}per Fijav\v{z} and David R. Wood},
     title = {The minor crossing number of graphs with an excluded minor},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/728},
     zbl = {1180.05034},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/728/}
}
TY  - JOUR
AU  - Drago Bokal
AU  - Gašper Fijavž
AU  - David R. Wood
TI  - The minor crossing number of graphs with an excluded minor
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/728/
DO  - 10.37236/728
ID  - 10_37236_728
ER  - 
%0 Journal Article
%A Drago Bokal
%A Gašper Fijavž
%A David R. Wood
%T The minor crossing number of graphs with an excluded minor
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/728/
%R 10.37236/728
%F 10_37236_728
Drago Bokal; Gašper Fijavž; David R. Wood. The minor crossing number of graphs with an excluded minor. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/728

Cité par Sources :