Nonorientable Genus of Nearly Complete Bipartite Graphs.

B. Mohar

Discrete & computational geometry (1988)

  • Volume: 3, Issue: 1-2, page 137-146
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Mohar, B.. "Nonorientable Genus of Nearly Complete Bipartite Graphs.." Discrete & computational geometry 3.1-2 (1988): 137-146. <http://eudml.org/doc/131042>.

@article{Mohar1988,
author = {Mohar, B.},
journal = {Discrete & computational geometry},
keywords = {edge deletion},
number = {1-2},
pages = {137-146},
title = {Nonorientable Genus of Nearly Complete Bipartite Graphs.},
url = {http://eudml.org/doc/131042},
volume = {3},
year = {1988},
}

TY - JOUR
AU - Mohar, B.
TI - Nonorientable Genus of Nearly Complete Bipartite Graphs.
JO - Discrete & computational geometry
PY - 1988
VL - 3
IS - 1-2
SP - 137
EP - 146
KW - edge deletion
UR - http://eudml.org/doc/131042
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.