论文信息 - Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers - 字舞流文

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers

We construct graphs with $n$ vertices of maximum degree $5$ whose every straight-line drawing in the plane uses edges of at least $n^{1/6-o(1)}$ distinct slopes.

János Pach | Dömötör Pálvölgyi

[1] David Eppstein,et al. Separating Thickness from Geometric Thickness , 2002, GD.

[2] Peter Robinson,et al. Drawability of Complete Graphs Using a Minimal Slope Set , 1994, Comput. J..

[3] D. S. Arnon,et al. Algorithms in real algebraic geometry , 1988 .

[4] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[5] Jirí Matousek,et al. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness , 2006, Electron. J. Comb..

[6] David R. Wood,et al. Really Straight Graph Drawings , 2004, GD.

[7] J. Pach. Towards a Theory of Geometric Graphs , 2004 .