The thickness of graphs: A survey

Graphs and Combinatorics

Volumn 14, Issue 1, 1998, Pages 59-73

  Mutzel, Petra ^a   Odenthal, Thomas ^b   Scharbrodt, Mark ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Columbia University ^*  (United States)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Branch and cut; Maximum planar subgraph; Thickness

Indexed keywords

EID: 0001833555     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007219     Document Type: Article

References (50)

1. Asano, K.: On the genus and thickness of graphs, J. Comb. Theory Ser. B 43, 287-292 (1987)
2. Alekseev, V.B., Gončakov, V.S.: The thickness of an arbitrary complete graph. Math. Sbornik 30(2), 187-202 (1976)
3. Aggarwal, A., Klawe, M., Shor, P.: Multilayer grid embeddings for VLSI. Algorithmica 1, 129-151 (1991)
4. Bouwer, I.Z., Broere, I.: Note on t-minimal bipartite graphs. Canad. Math. Bull. 11, 729-732 (1968)
5. Beineke, L.W.: Complete bipartite graphs: Decomposition into planar subgraphs. In: F. Harary: A seminar on graph theory, pp. 42-53. New York: 1967.
6. Beineke, L.W.: The decomposition of complete graphs into planar subgraphs. In: Graph theory and theoretical physics, pp. 139-153. New York: Academic Press, 1967
7. Beineke, L.W.: Minimal decompositions of complete graphs into subgraphs with embeddability properties. Canad. J. Math. 21, 992-1000 (1969)
8. Beineke, L.W.: Fruited planes. Congressus Numerantium 63, 127-138 (1988)
9. Beineke, L. W., Harary, F.: The thickness of the complete graph. Canad. J. Math. 17, 850-859 (1965)
10. Battle, J., Harary, F., Kodoma, Y.: Every planar graph with nine points has a nonplanar complement. Bull. Amer. Math Soc. 68, 569-571 (1962)
11. Beineke, L.W., Harary, F., Moon, J.W.: On the thickness of the complete bipartite graph. Proc. Camb. Phil. Soc. 60, 1-5 (1964)
12. Bilski, T.: Embedding graphs in books: a survey. IEEE Proceedings-E, Vol. 139, No. 2, March 1992.
13. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, Interval graphs and graph planarity testing using PQ-tree algorithms. J. of Computer and Systems Sciences 13, 335-379 (1976)
14. Bose, N.K., Prabhu, K.A.: Thickness of graphs with degree constrained vertices. IEEE Trans, on Circuits and Systems 24, 184-190 (1977)
15. Beineke, L., Wilson, R.: Selected topics in graph theory, pp 15-49. New York: Academic Press 1978
16. Cǎlinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for the maximum planar subgraph problem, Proc. of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 16-25. SODA'96, Atlanta, Georgia, 1996
17. Cai, J., Han, X., Tarjan, R.E.: An O(m log n)-Time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22, 1142-1162 (1993)
18. Chatrand, G., Geller, D., Hedetniemi, S.: Graphs with forbidden subgraphs. J. Comb. Theory 10, 12-41 (1971)
19. Dean, A.M., Hutchinson, J.P.: Relations among embedding parameters for graphs. In: Int'l Conf. on the Theory and Applications of Graphs, Kalamazoo, MI, 1988
20. Dean, A.M., Hutchinson, J.P.: Rectangle-visibility representations of bipartite graphs, Extended Abstract, Lecture Notes in Computer Science 894: R. Tamassia and I. Tollis: Graph Drawing, pp. 159-166. Berlin Heidelberg New York: Springer 1995
21. Dean, A.M., Hutchinson, J.P., Scheinerman, E.: On the thickness and arboricity of a graph. J. Comb. Theory Ser. B 52, 147-151 (1991)
22. Guy, R.K.: Outerthickness and outercoarseness of graphs, in: Combinatorics, London Math. Soc. Lecture Notes 13, pp. 57-60. London: Cambridge University Press 1974
23. Halton, J.: On the thickness of graphs of given degree. Info. Sci. 54, 219-238 (1991)
24. Harary, F.: Research problem. Bull. Amer. Math. Soc. 67, 542 (1961)
25. Harary, F.: Graph Theory, Addison Wesely, 1969
26. Hobbs, A.M., Grossman, J.W.: Thickness and connectivity in graphs. J. Res. nat. Bur. Standards Sect. B 72, 239-244 (1968)
27. Hutchinson, J., T. Shermer, Vince, A.: On Representations of some thickness-two graphs, Extended Abstract, Lecture Notes in Computer Science 1027, F. Brandenburg: Graph Drawing '95. pp. 324-332. Berlin Heidelberg New York: Springer 1996
28. Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM 21, 549-568 (1974)
29. Jünger, M., Mutzel, P.: Solving the maximum planar subgraph problem by branch and cut. Proc. 3rd IPCO Conf. Erice, 1993
30. Jünger, M., Mutzel, P.: Maximum planar subgraph and nice embeddings: Practical layout tools, Algorithmica 16, No. 1 33-59 (1996)
31. Jünger, M., Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of a minor-excluded class of graphs, Discrete Mathematics, Special Volume on the Third Slovenian International Conference in Graph Theory, Bled (to appear 1997)
32. Jordan, E.: personal communication
33. 2) Algorithms for graph planarization. IEEE Trans, on Computer-aided Design 8, 257-267 (1989)
34. 2) Maximal planarization algorithm based on PQ-trees, Technical Report, RUU-CS-92-03, Dept. of Computer Science, Utrecht University, 1992
35. Kleinert, M.: Die Dicke des n-dimensionalen Würfel-Graphen. J. Comb. Theory 3, 10-15 (1967)
36. Leipert, S.: The Problem of Computing a Maximal Planar Subgraph Using PQ-Trees is still not solved. Special proceedings for students pp. 95-110. ECMI'94, Kaiserslautern 1994
37. Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. Proc. 10th S-E Conf. Combinatorics, Graph Theory, and Computing, pp. 727-738. FL: Boca Raton 1997
38. Mansfield, A.: Determining the thickness of graphs is NP-hard. Math. Proc. Cambridge Philos. Soc. 9, 9-23 (1983)
39. 16 en Trois Graphes Planaires, J. Comb. Theory Ser. B 13, 71 (1972)
40. Nash-Williams, C.St.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445-450 (1961)
41. Ozawa, T., Takahashi, H.: A graph-planarization algorithm and its application to random graphs, Graph Theory and Algorithms, Lecture Notes in Computer Science 108, 95-107 (1981)
42. Ringel, G.: Die torodiale Dicke des vollständigen Graphen. Math. Z. 87, 19-26 (1965)
43. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. ACM SIGCOMM Computer Communication Review 22, 211-222 (1992)
44. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks, IEEE/ACM Transactions on Networking 1, 166-177 (1993)
45. Širáň, J., Horák, P.: A construction of thickness-minimal graphs. Discr. Math. 64, 262-268 (1987)
46. Tutte, W.T.: The non-biplanar character of the complete 9-graph. Canad. Math. Bull. 6, 319-330 (1963)
47. Tutte, W.T.: The thickness of a graph. Indag. Math. 25, 567-577 (1963)
48. Walther, H.: Über die Zerlegung des vollständigen Graphen in paare planare Graphen. In: H. Sachs: Beiträge zur Graphentheorie, pp. 189-205. Leipzig: Teubner 1968
49. Wessel, W.: On some variations of the thickness of a graph connected with colouring. In: Graphs and other combinatorial topics, Teubner Texte Math. 59 pp. 344-348, 1983
50. Winter, A.: Heuristiken für nicht-planare Graphen, Diplomarbeit Universität Passau, 1993