One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
- 23 December 2021
- book chapter
- Published by Springer Nature
- p. 184-192
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Extending Convex Partial Drawings of GraphsAlgorithmica, 2015
- Testing Planarity of Partially Embedded GraphsACM Transactions on Algorithms, 2015
- A Kuratowski-type theorem for planarity of partially embedded graphsComputational Geometry, 2013
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWINGInternational Journal of Computational Geometry & Applications, 2012
- Convex drawings of graphs with non-convex boundary constraintsDiscrete Applied Mathematics, 2008
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWINGInternational Journal of Foundations of Computer Science, 2006
- Selected Open Problems in Graph DrawingLecture Notes in Computer Science, 2004
- Embedding Planar Graphs at Fixed Vertex LocationsGraphs and Combinatorics, 2001
- How to draw a planar graph on a gridCombinatorica, 1990
- Efficient Vertex- and Edge-Coloring of Outerplanar GraphsSIAM Journal on Algebraic Discrete Methods, 1986