Geodesic
Nonorientable Genus of Nearly Complete Bipartite Graphs.
Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 137-146.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : edge deletion 
@article{DCG_1988__3_1-2_131042,
     author = {B. Mohar},
     title = {Nonorientable {Genus} of {Nearly} {Complete} {Bipartite} {Graphs.}},
     journal = {Discrete & computational geometry},
     pages = {137--146},
     publisher = {mathdoc},
     volume = {3},
     number = {1-2},
     year = {1988},
     zbl = {0628.05026},
     url = {http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131042/}
}
TY  - JOUR
AU  - B. Mohar
TI  - Nonorientable Genus of Nearly Complete Bipartite Graphs.
JO  - Discrete & computational geometry
PY  - 1988
SP  - 137
EP  - 146
VL  - 3
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131042/
ID  - DCG_1988__3_1-2_131042
ER  - 
%0 Journal Article
%A B. Mohar
%T Nonorientable Genus of Nearly Complete Bipartite Graphs.
%J Discrete & computational geometry
%D 1988
%P 137-146
%V 3
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131042/
%F DCG_1988__3_1-2_131042
B. Mohar. Nonorientable Genus of Nearly Complete Bipartite Graphs.. Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 137-146. http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131042/