Name
Abstract | ||
|---|---|---|
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with maximum degree Δ. We show that the planar slope number of every planar partial 3-tree and also every plane partial 3-tree is at most O(Δ 5). In particular, we answer the question of Dujmović et al. (Comput Geom 38(3):194---212, 2007) whether there is a function f such that plane maximal outerplanar graphs can be drawn using at most f(Δ) slopes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00373-012-1157-z | Graphs and Combinatorics |
Keywords | Field | DocType |
Graph drawing, Planar graphs, Slopes, Planar slope number, 68R10, 05C10, 05C62 | Discrete mathematics,Combinatorics,Outerplanar graph,Slope number,Polyhedral graph,Planar straight-line graph,Book embedding,Degree (graph theory),1-planar graph,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 4 | 1435-5914 |
ISBN | Citations | PageRank |
3-642-11804-6 | 6 | 0.59 |
References | Authors | |
9 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vít Jelínek | 1 | 149 | 20.45 |
| Eva Jelínková | 2 | 51 | 5.58 |
| Jan Kratochvíl | 3 | 1751 | 151.84 |
| Bernard Lidický | 4 | 181 | 23.68 |
| Marek Tesar | 5 | 7 | 1.63 |
| Tomás Vyskocil | 6 | 23 | 2.38 |