Geometric thickness of complete graphs.
Dillencourt, Michael B.; Eppstein, David; Hirschberg, Daniel S.
Journal of Graph Algorithms and Applications (2000)
- Volume: 4, Issue: 3, page 5-17,
- ISSN: 1526-1719
Access Full Article
top
How to cite
topDillencourt, Michael B., Eppstein, David, and Hirschberg, Daniel S.. "Geometric thickness of complete graphs.." Journal of Graph Algorithms and Applications 4.3 (2000): 5-17,. <http://eudml.org/doc/48635>.
@article{Dillencourt2000,
author = {Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S.},
journal = {Journal of Graph Algorithms and Applications},
keywords = {geometric thickness; complete bipartite graphs},
language = {eng},
number = {3},
pages = {5-17,},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Geometric thickness of complete graphs.},
url = {http://eudml.org/doc/48635},
volume = {4},
year = {2000},
}
TY - JOUR
AU - Dillencourt, Michael B.
AU - Eppstein, David
AU - Hirschberg, Daniel S.
TI - Geometric thickness of complete graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2000
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 4
IS - 3
SP - 5
EP - 17,
LA - eng
KW - geometric thickness; complete bipartite graphs
UR - http://eudml.org/doc/48635
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.