论文信息 - Drawing Cubic Graphs with at Most Five Slopes

Drawing Cubic Graphs with at Most Five Slopes

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice.

Balázs Keszegh | János Pach | Géza Tóth | Dömötör Pálvölgyi

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

[2] David R. Wood,et al. Graph drawings with few slopes , 2007, Comput. Geom..

[3] János Pach,et al. Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers , 2006, Electron. J. Comb..

[4] Ioannis G. Tollis,et al. Graph Drawing , 1994, Lecture Notes in Computer Science.

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

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

[7] Walter Didimo,et al. Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size , 1999, GD.

[8] David Eppstein,et al. The geometric thickness of low degree graphs , 2003, SCG '04.

[9] Greg A. Wade,et al. Drawability of Complete Graphs Using a Minimal Slope Set , 1994, Comput. J..

[10] Balázs Keszegh,et al. Drawing cubic graphs with at most five slopes , 2008, Comput. Geom..

[11] Peter Ungar. On Diagrams Representing Maps , 1953 .

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

[13] David Eppstein,et al. Drawings of planar graphs with few slopes and segments , 2007, Comput. Geom..