The number of crossings in a regular drawing of the complete bipartite graph.
Journal of Integer Sequences [electronic only] (2009)
- Volume: 12, Issue: 5, page Article ID 09.5.5, 8 p., electronic only-Article ID 09.5.5, 8 p., electronic only
- ISSN: 1530-7638
Access Full Article
top
How to cite
topLegendre, Stéphane. "The number of crossings in a regular drawing of the complete bipartite graph.." Journal of Integer Sequences [electronic only] 12.5 (2009): Article ID 09.5.5, 8 p., electronic only-Article ID 09.5.5, 8 p., electronic only. <http://eudml.org/doc/227978>.
@article{Legendre2009,
author = {Legendre, Stéphane},
journal = {Journal of Integer Sequences [electronic only]},
keywords = {complete bipartite graph; greatest common divisor},
language = {eng},
number = {5},
pages = {Article ID 09.5.5, 8 p., electronic only-Article ID 09.5.5, 8 p., electronic only},
publisher = {School of Computer Science, University of Waterloo, Waterloo},
title = {The number of crossings in a regular drawing of the complete bipartite graph.},
url = {http://eudml.org/doc/227978},
volume = {12},
year = {2009},
}
TY - JOUR
AU - Legendre, Stéphane
TI - The number of crossings in a regular drawing of the complete bipartite graph.
JO - Journal of Integer Sequences [electronic only]
PY - 2009
PB - School of Computer Science, University of Waterloo, Waterloo
VL - 12
IS - 5
SP - Article ID 09.5.5, 8 p., electronic only
EP - Article ID 09.5.5, 8 p., electronic only
LA - eng
KW - complete bipartite graph; greatest common divisor
UR - http://eudml.org/doc/227978
ER -
NotesEmbed ?
topYou 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.