论文信息 - Non-convex Representations of Graphs - 字舞流文

Non-convex Representations of Graphs

We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygons.

Giuseppe Di Battista | Fabrizio Frati | Maurizio Patrignani

[1] Marek Chrobak,et al. Convex drawings of graphs in two and three dimensions (preliminary version) , 1996, SCG '96.

[2] Stefan Felsner,et al. Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.

[3] Günter Rote,et al. Planar minimally rigid graphs and pseudo-triangulations , 2005, Comput. Geom..

[4] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .

[5] Hiroshi Nagamochi,et al. Convex Drawings of Graphs with Non-convex Boundary , 2006, WG.

[6] K. Wagner. Bemerkungen zum Vierfarbenproblem. , 1936 .

[7] F. Leighton,et al. Drawing Planar Graphs Using the Canonical Ordering , 1996 .

[8] Francisco Santos,et al. Pseudo-Triangulations - a Survey , 2006 .

[9] Günter Rote,et al. Pointed drawings of planar graphs☆ , 2012, CCCG.

[10] Hiroshi Nagamochi,et al. Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints , 2008, COCOON.

[11] M. Chrobak,et al. Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[12] J. A. Bondy,et al. Progress in Graph Theory , 1984 .

[13] W. T. Tutte. Convex Representations of Graphs , 1960 .

[14] Ôôöøøøøóò Óó,et al. Strictly Convex Drawings of Planar Graphs , 2022 .