Planar graphs with topological constraints.
Journal of Graph Algorithms and Applications (2002)
- Volume: 6, Issue: 1, page 27-66
- ISSN: 1526-1719
Access Full Article
topHow to cite
topDornheim, Christoph. "Planar graphs with topological constraints.." Journal of Graph Algorithms and Applications 6.1 (2002): 27-66. <http://eudml.org/doc/49578>.
@article{Dornheim2002,
author = {Dornheim, Christoph},
journal = {Journal of Graph Algorithms and Applications},
keywords = {embeddings of planar graphs; topological constraints; cycle; graph visualization; embedding algorithms; planarity; NP-complete; polynomial time algorithm; biconnected graphs; reduction method},
language = {eng},
number = {1},
pages = {27-66},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Planar graphs with topological constraints.},
url = {http://eudml.org/doc/49578},
volume = {6},
year = {2002},
}
TY - JOUR
AU - Dornheim, Christoph
TI - Planar graphs with topological constraints.
JO - Journal of Graph Algorithms and Applications
PY - 2002
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 6
IS - 1
SP - 27
EP - 66
LA - eng
KW - embeddings of planar graphs; topological constraints; cycle; graph visualization; embedding algorithms; planarity; NP-complete; polynomial time algorithm; biconnected graphs; reduction method
UR - http://eudml.org/doc/49578
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.