Biplanar Graphs: A Survey

Computers and Mathematics with Applications

Volumn 34, Issue 11, 1997, Pages 1-8

  Beineke, L W ^a  

^a INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

Author keywords

Biplanar graphs; Doubly linear graphs; Planar graphs; Thickness; Visibility graphs

Indexed keywords

THEOREM PROVING;

BIPLANAR GRAPHS; DOUBLY LINEAR GRAPHS;

GRAPH THEORY;

EID: 0031354729     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0898-1221(97)00214-9     Document Type: Article

References (27)

1. L.W. Beineke, Fruited planes, Congr. Numer. 63, 127-138 (1988).
2. J. Battle, F. Harary and Y. Kodama, Every planar graph with nine points has a nonplanar complement, Bull. Amer. Math. Soc. 68, 569-571 (1962).
3. W.T. Tutte, On the non-biplanar character of the complete 9-graph, Canad. Math. Bull. 6, 319-330 (1963).
4. W.T. Tutte, The thickness of a graph, Indag. Math. 25, 567-577 (1963).
5. D.C.B. Marsh, Solution to Problem E 1465, Amer. Math. Monthly 68, 1009 (1961).
6. V.R. Kodres, Problem E 1465, Amer. Math. Monthly 68, 379 (1961).
7. L.W. Beineke and F. Harary, The thickness of the complete graph, Canad. J. Math. 17, 850-859 (1965).
8. J.M. Vasak, The thickness of the complete graph, Notices Amer. Math. Soc. 23, A-479 (1976).
9. V.B. Alekseev and V.S. Gonchakov, Thickness of arbitrary complete graphs (Russian), Mat. Sbornik 101, 212-230 (1976).
10. L.W. Beineke, P. Harary and J.W. Moon, On the thickness of the complete bipartite graph, Proc. Cambridge Phil. Soc. 60, 1-6 (1964).
11. A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc. 93, 9-23 (1983).
12. S. Okawa and Y. Nichitani, Bipartite subgraph problems with degree at most three, Systems, Computers, Controls. 10, 27-34 (1979).
13. J.P. Hutchinson, Coloring ordinary maps, maps of empires, and maps of the moon, Math. Mag. 66, 211-226 (1993).
14. N.K. Bose and K.A. Prabhu, Thickness of graphs with degree constrained vertices, IEEE Trans. Circuits and Systems 24, 184-190 (1977).
15. J. Halton, On the thickness of graphs of given degree, Info. Sci. 54, 219-238 (1991).
16. J.P. Hutchinson, T. Shermer and A. Vince, On representations of some thickness-two graphs, (preprint).
17. R. Tamassia and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1, 321-341 (1986).
18. st Symp. Comp. ACM, 147-152 (1985).
19. A.M. Dean and J.P. Hutchinson, Rectangle-visibility representations of bipartite graphs, (preprint).
20. L.W. Beineke, On the decomposition of complete graphs into planar and other subgraphs, Ph.D. Dissertation, University of Michigan, (1965).
21. L.W. Beineke, Minimal decompositions of complete graphs into subgraphs with embeddability properties, Canad. J. Math. 21, 992-1000 (1969).
22. G. Ringel, Die toroidale Dicke der vollständigen Graphen, Math. Z. 87, 19-26 (1965).
23. I. Anderson and R.J. Cook, Bi-embeddings of graphs, Glasgow Math. J. 15, 162-165 (1974).
24. I. Anderson and A.T. White, Current graphs and bi-embeddings, J. Graph Theory 2, 231-239 (1978).
25. I. Anderson, Infinite families of biembedding numbers, J. Graph Theory 3, 263-268 (1979).
26. S. Cabaniss and B.W. Jackson, Infinite families of bi-embeddings, Discrete Math. 82, 127-141 (1990).
27. S. Cabaniss, A survey of biembeddings of graphs, Congr. Numer. 70, 171-180 (1990).