3-coloring Arrangements of Line Segments with 4 Slopes Is Hard
暂无分享,去创建一个
[1] David Eppstein,et al. Testing bipartiteness of geometric intersection graphs , 2003, SODA '04.
[2] Michal Lason,et al. Coloring Intersection Graphs of Arc-Connected Sets in the Plane , 2013, Discret. Comput. Geom..
[3] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[4] Ioannis G. Tollis,et al. Techniques for Edge Stratification of Complex Graph Drawings , 2014, J. Vis. Lang. Comput..
[5] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Prosenjit Bose,et al. Some properties of k-Delaunay and k-Gabriel graphs , 2013, Comput. Geom..
[8] Branko Grünbaum,et al. On a Coloring Problem. , 1960 .
[9] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..
[10] A. Gräf,et al. On Coloring Unit Disk Graphs , 1998, Algorithmica.
[11] Andrew Suk. Coloring intersection graphs of x-monotone curves in the plane , 2014, Comb..