On representations of some thickness-two graphs
暂无分享,去创建一个
[1] F. Harary,et al. Every planar graph with nine points has a nonplanar complement , 1962 .
[2] Anthony Mansfield,et al. Determining the thickness of graphs is NP-hard , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.
[3] Thomas C. Shermer,et al. On Rectangle Visibility Graphs. III. External Visibility and Complexity , 1996, CCCG.
[4] David G. Kirkpatrick,et al. Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract) , 1989, WADS.
[5] Michael Randolph Garey,et al. An Application of Graph Coloring to Printed Circuit Testing (Working Paper) , 1975, FOCS 1975.
[6] H. S. M. Coxeter,et al. Vorlesungen über die Theorie der Polyeder , 1935 .
[7] W. T. Tutte. The Non-Biplanar Character of the Complete 9-Graph , 1963, Canadian Mathematical Bulletin.
[8] Prosenjit Bose,et al. On Rectangle Visibility Graphs , 1996, GD.
[9] Joan P. Hutchinson,et al. Rectangle-visibility Representations of Bipartite Graphs , 1994, Discret. Appl. Math..
[10] Joan P. Hutchinson,et al. Journal of Graph Algorithms and Applications Rectangle-visibility Layouts of Unions and Products of Trees , 2022 .
[11] W. T. Tutte,et al. The thickness of a graph , 1963 .
[12] Prosenjit Bose,et al. On Rectangular Visibility Graphs, Graph Drawing , 1997 .
[13] E. Steinitz,et al. Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .
[14] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[15] Stephen K. Wismath,et al. Characterizing bar line-of-sight graphs , 1985, SCG '85.
[16] J. Hutchinson,et al. Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon , 1993 .