Graph drawings with few slopes

Computational Geometry: Theory and Applications

Volumn 38, Issue 3, 2007, Pages 181-193

  Dujmović, Vida ^a   Suderman, Matthew ^b   Wood, David R ^c  

^a MCGILL UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Graph drawing; Slope; Slope number

Indexed keywords

EID: 84867951774     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.08.002     Document Type: Article

References (43)

1. G. Ambrus, J. Barát, P. Hajnal, The slope parameter of graphs, Tech. Rep. MAT-2005-07, Department of Mathematics, Technical University of Denmark, Lyngby, Denmark, 2005
2. J. Barát, J. Matoušek, and D.R. Wood Bounded-degree graphs have arbitrarily large geometric thickness Electron. J. Combin. 13 1 2006 R3
3. E.A. Bender, and E.R. Canfield The asymptotic number of labeled graphs with given degree sequences J. Combin. Theory Ser. A 24 1978 296 307
4. H.L. Bodlaender The complexity of finding uniform emulations on paths and ring networks Inform. and Comput. 86 1 1990 87 106
5. H.L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209 1-2 1998 1 45
6. H.L. Bodlaender A note on domino treewidth Discrete Math. Theor. Comput. Sci. 3 4 1999 141 150
7. P. Bose, F. Gómez, P.A. Ramos, and G.T. Toussaint Drawing nice projections of objects in space F.J. Brandenburg, Proc. International Symp. on Graph Drawing (GD '95) Lecture Notes in Comput. Sci. vol. 1027 1996 Springer Berlin 52 63
8. J. Czyzowicz Lattice diagrams with few slopes J. Combin. Theory Ser. A 56 1 1991 96 108
9. J. Czyzowicz, A. Pelc, and I. Rival Drawing orders with few slopes Discrete Math. 82 3 1990 233 250
10. J. Czyzowicz, A. Pelc, I. Rival, and J. Urrutia Crooked diagrams with few slopes Order 7 2 1990 133 143
11. M.B. Dillencourt, D. Eppstein, and D.S. Hirschberg Geometric thickness of complete graphs J. Graph Algorithms Appl. 4 3 2000 5 17
12. G. Ding, and B. Oporowski Some results on tree decomposition of graphs J. Graph Theory 20 4 1995 481 499
13. V. Dujmović, D. Eppstein, M. Suderman, and D.R. Wood Drawings of planar graphs with few slopes and segments Comput. Geom. 38 3 2007 194 212 this issue
14. V. Dujmović, M. Suderman, and D.R. Wood Really straight graph drawings J. Pach, Proc. 12th International Symp. on Graph Drawing (GD '04) Lecture Notes in Comput. Sci. vol. 3383 1996 Springer Berlin 122 132
15. V. Dujmović, and D.R. Wood On linear layouts of graphs Discrete Math. Theor. Comput. Sci. 6 2 2004 339 358
16. V. Dujmović, and D.R. Wood Graph treewidth and geometric thickness parameters P. Healy, N.S. Nikolov, Proc. 13th International Symp. on Graph Drawing (GD '05) Lecture Notes in Comput. Sci. vol. 3843 2006 Springer Berlin 129 140 http://arxiv.org/math/0503553
17. C.A. Duncan, D. Eppstein, and S.G. Kobourov The geometric thickness of low degree graphs Proc. 20th ACM Symp. on Computational Geometry (SoCG '04) 2004 ACM Press New York 340 346
18. P. Eades, M.E. Houle, and R. Webber Finding the best viewpoints for three-dimensional graph drawings G. Di Battista, Proc. 5th International Symp. on Graph Drawing (GD '97) Lecture Notes in Comput. Sci. vol. 1353 1997 Springer Berlin 87 98
19. D. Eppstein Separating thickness from geometric thickness J. Pach, Towards a Theory of Geometric Graphs Contemporary Mathematics vol. 342 2004 Amer. Math. Soc. Providence, RI 75 86
20. K. Ferber, and H. Jürgensen A programme for the drawing of lattices J. Leech, Computational Problems in Abstract Algebra 1970 Pergamon Oxford 83 87
21. F.V. Fomin, and P.A. Golovach Interval degree and bandwidth of a graph Discrete Appl. Math. 129 2-3 2003 345 359
22. R. Freese Automated lattice drawing P.W. Eklund, Concept Lattices. Proc. 2nd International Conf. on Formal Concept Analysis (ICFCA '04) Lecture Notes in Comput. Sci. vol. 2961 2004 Springer Berlin 112 127
23. M.E. Houle, and R. Webber Approximation algorithms for finding best viewpoints S. Whitesides, Proc. 6th International Symp. on Graph Drawing (GD '98) Lecture Notes in Comput. Sci. vol. 1547 1998 Springer Berlin 210 223
24. R.E. Jamison Planar configurations which determine few slopes Geom. Dedicata 16 1 1984 17 34
25. R.E. Jamison Structure of slope-critical configurations Geom. Dedicata 16 3 1984 249 277
26. R.E. Jamison Few slopes without collinearity Discrete Math. 60 1986 199 206
27. R.E. Jamison Direction trees Discrete Comput. Geom. 2 3 1987 249 254
28. D.J. Kleitman, and R. Pinchasi A note on caterpillar-embeddings with no two parallel edges Discrete Comput. Geom. 33 2 2005 223 229
29. S.M. Malitz Graphs with E edges have pagenumber O (E) J. Algorithms 17 1 1994 71 84
30. B.D. McKay Asymptotics for symmetric 0-1 matrices with prescribed row sums Ars Combin. 19 A 1985 15 25
31. S. Onn, and R. Pinchasi A note on the minimum number of edge-directions of a convex polytope J. Combin. Theory Ser. A 107 2004 147 151
32. J. Pach, and D. Pálvölgyi Bounded-degree graphs can have arbitrarily large slope numbers Electron. J. Combin. 13 1 2006 N1
33. J. Pach, R. Pinchasi, and M. Sharir On the number of directions determined by a three-dimensional points set J. Combin. Theory Ser. A 108 1 2004 1 16
34. J. Pach, R. Pinchasi, and M. Sharir Solution of Scott's problem on the number of directions determined by a point set in 3-space Proc. 20th ACM Symp. on Computational Geometry (SoCG '04) 2004 ACM Press New York 76 85
35. B.A. Reed Algorithmic aspects of tree width A. Reed, C.L. Sales, Recent Advances in Algorithms and Combinatorics 2003 Springer New York 85 107
36. P. Scheffler, Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme, PhD thesis, Akademie der Wissenschaften der DDR, Berlin, Germany, 1989
37. P.R. Scott On the sets of directions determined by n points Amer. Math. Monthly 77 1970 502 505
38. M. Suderman Pathwidth and layered drawings of trees Internat. J. Comput. Geom. Appl. 14 3 2004 203 225
39. P. Ungar 2N noncollinear points determine at least 2N directions J. Combin. Theory Ser. A 33 3 1982 343 347
40. G.A. Wade, and J.-H. Chu Drawability of complete graphs using a minimal slope set Computer J. 37 2 1994 139 142
41. D.R. Wood Characterisations of intersection graphs by vertex orderings Australas. J. Combin. 34 2006 261 268
42. D.R. Wood A note on tree-partition-width http://arxiv.org/math/0602507 2006
43. N. Wormald, Some problems in the enumeration of labelled graphs, PhD thesis, Newcastle-upon-Tyne, United Kingdom, 1978