Bounded-degree graphs can have arbitrarily large slope numbers

Electronic Journal of Combinatorics

Volumn 13, Issue 1 N, 2006, Pages 1-4

  Pach, János ^a   Pálvölgyi, Dömötör ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30344461629     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1139     Document Type: Article

References (6)

1. [BMW05] J. Barát, J. Matous̈ek, and D.R. Wood: Bounded-degree graphs have arbitrarily large geometric thickness, The Electronic J. Combin., 13 (2006), R3.
2. [BPR03] S. Basu, R. Pollack, and M.-F. Roy: Algorithms in Real Algebraic Geometry, Springer-Verlag, Berlin, 2003.
3. [BC78] 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. [DSW04] V. Dujmović, M. Suderman, and D.R. Wood: Really straight graph drawings, in: Graph Drawing (GD '04) (J. Pach, ed.), Lecture Notes in Computer Science 3383, Springer-Verlag, Berlin, 2004, 122-132.
5. [E04] D. Eppstein: Separating thickness from geometric thickness, in: Towards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics 342, Amer. Math. Soc., 2004, 75-86.
6. [WC94] G. A. Wade and J.-H. Chu: Drawability of complete graphs using a minimal slope set, The Computer J. 37/2 (1994), 139-142.