Planarizing graphs - A survey and annotated bibliography

Journal of Graph Algorithms and Applications

Volumn 5, Issue 1, 2001, Pages 1-74

  Liebers, Annegret ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

UNDIRECTED GRAPHS;

ALGORITHMICS; CROSSING NUMBER; GRAPH G; GRAPH PARAMETERS; ON-LINE ALGORITHMS; PLANAR GRAPH; PLANARIZATION; PLANARIZING; SIMPLE++; SPLITTING NUMBER;

SURVEYS;

EID: 0013157887     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00032     Document Type: Review

References (322)

1. [AAP+96] Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, and Micha Sharir. Quasi-Planar Graphs Have a Linear Number of Edges. In Franz J. Brandenburg, editor, Graph Drawing. Proceedings of the DIMACS International Workshop, GD'95, pages 1-7. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.
2. [ABL95] Dan Archdeacon, C. Paul Bonnington, and Charles H.C. Little. An Algebraic Characterization of Planar Graphs. J. of Graph Theory, 19:237-250, 1995.
3. [ACNS82] M. Ajtai, V. Chvátal, M.N. Newborn, and E. Szemerédi. Crossing-free subgraphs. In Alexander Rosa and Anton Kotzig, editors, Theory and practice of combinatorics: a collection of articles honoring Anton Kotzig on the occasion of his 60th birthday, pages 9-12. North-Holland, Annals of Discrete Mathematics, vol. 12, 1982.
4. [AG76] V.B. Alekseev and V.S. Goncakov. The thickness of an arbitrary complete graph. Mat. Sbornik, 101(143):212-230, 1976. In Russian.
5. [AKS91] Alok Aggarwal, Maria Klawe, and Peter Shor. Multilayer Grid Embeddings for VLSI. Algorithmica, 6:129-151, 1991.
6. [AMO93] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows. Prentice Hall, 1993.
7. [And82a] Ian Anderson. On the toroidal thickness of graphs. J. of Graph Theory, 6:177-184, 1982.
8. [And82b] Ian Anderson. The Toroidal Thickness of the Symmetric Quadripartite Graph. J. of Combinatorial Theory, Series B, 33:57-59, 1982.
9. [AP61] L. Auslander and S.V. Parter. On Imbedding Graphs in the Sphere. J. of Mathematics and Mechanics, 10(3):517-523, 1961.
10. [AP93] D.G. Akka and S.V. Panshetty. The edge-outercoarseness of complete graphs. Bull. Cal. Math. Soc., 85:505-512, 1993.
11. [Arc84] Dan Archdeacon. Face Colorings of Embedded Graphs. J. of Graph Theory, 8:387-398, 1984.
12. 2;3;n. J. of Graph Theory, 10:1-8, 1986.
13. [Asa87] Kouhei Asano. On the genus and thickness of graphs. J. of Combinatorial Theory, Series B, 43:287-292, 1987.
14. [Asa94] Kouhei Asano. On the thickness of graphs with genus 2. Ars Combinatoria, 38:87-95, 1994.
15. [Bar82] D.W. Barnette. Generating the triangulations of the projective plane. J. of Combinatorial Theory, Series B, 33:222-230, 1982.
16. 5. Operations Research Letters, 2:107-111, 1983.
17. [Bar87] D.W. Barnette. Generating closed 2-cell embeddings in the torus and the projective plane. Discrete Comput. Geom., 2:233-247, 1987.
18. [Bar90] D.W. Barnette. Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane. Discrete Mathematics, 85(1):1-16, 1990.
19. [Bar91] D.W. Barnette. The minimal projective plane polyhedral maps. In Peter Gritzmann and Victor Klee, editors, Applied geometry and discrete mathematics: The Victor Klee Festschrift, volume 4 of DIMACS Series in Discrete Mathematics and Computer Science, pages 63-70. American Mathematical Society, 1991.
20. [BB68] I.Z. Bouwer and I. Broere. Note on t-minimal complete bipartite graphs. Canad. Math. Bull., 11:729-732, 1968.
21. [BD92] Daniel Bienstock and Nathaniel Dean. New Results on Rectilinear Crossing Numbers and Plane Embeddings. J. of Graph Theory, 16:389-398, 1992.
22. [BD93] Daniel Bienstock and Nathaniel Dean. Bounds for rectilinear crossing numbers. J. of Graph Theory, 17:333-348, 1993.
23. [BE88] D.W. Barnette and A.L. Edelson. All Orientable 2-Manifolds Have Finitely Many Minimal Triangulations. Israel J. of Mathematics, 62:90-98, 1988.
24. [BE89] D.W. Barnette and A.L. Edelson. All 2-Manifolds Have Finitely Many Minimal Triangulations. Israel J. of Mathematics, 67:123-128, 1989.
25. [Bei67] Lowell W. Beineke. Complete Bipartite Graphs: Decomposition into Planar Subgraphs. In Frank Harary, editor, A Seminar on Graph Theory. Holt, Rinehart and Winston, 1967.
26. [Bei69] Lowell W. Beineke. Minimal decompositions of complete graphs. Can. J. Math., 21:992-1000, 1969.
27. [Bei88] Lowell W. Beineke. Fruited planes. In Graph theory, 250th Anniv. Conf., Lafayette/Indiana 1986, volume 63 of Congressus Numerantium, pages 127-138, 1988.
28. [Ber73] Claude Berge. Graphs and Hypergraphs. North-Holland, 1973.
29. [Ber89] Claude Berge. Hypergraphs. North-Holland, 1989.
30. [BG69] Lowell W. Beineke and Richard K. Guy. The coarseness of the complete bipartite graph. Can. J. Math., 21:1086-1096, 1969.
31. [BH65] Lowell W. Beineke and Frank Harary. The thickness of the complete graph. Can. J. Math., 17:850-859, 1965.
32. [BHK62] Joseph Battle, Frank Harary, and Yukihiro Kodama. Every planar graph with nine points has a nonplanar complement. Bulletin of the American Mathematical Society, 68:569-571, 1962.
33. [BHM64] Lowell W. Beineke, Frank Harary, and John W. Moon. On the thickness of the complete bipartite graph. Proc. Camb. Phil. Soc., 60:1-5, 1964.
34. [Bie91] Daniel Bienstock. Some Provably Hard Crossing Number Problems. Discrete Comput. Geom., 6:443-459, 1991.
35. [BK79] Frank Bernhart and Paul C. Kainen. The Book Thickness of a Graph. J. of Combinatorial Theory, Series B, 27:320-331, 1979.
36. [BL76] Kellogg S. Booth and George S. Lueker. Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Computer and System Sciences, 13:335-379, 1976.
37. [BL95] C. Paul Bonnington and Charles H.C. Little. The Foundations of Topological Graph Theory. Springer, 1995.
38. [BLW76] Norman L. Biggs, E. Keith Lloyd, and Robin J. Wilson. Graph Theory: 1736-1936. Clarendon Press, Oxford, 1976.
39. [BM76] John A. Bondy and Uppaluri R.S. Murty. Graph theory with applications. North-Holland, 1976.
40. [BM99] John Boyer and Wendy Myrvold. Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99, pages 140-146, 1999.
41. [BS84] Jonathan F. Buss and Peter Shor. On the pagenumber of planar graphs. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84, pages 98-100, 1984.
42. [BS93] Graham R. Brightwell and Edward R. Scheinerman. Representations of planar graphs. SIAM J. Discrete Math., 6:214-229, 1993.
43. [CF96] Gruia Cǎlinescu and Cristina G. Fernandes. Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. In Jin-Yi Cai and Chak Kuen Wong, editors, Proceedings 2nd Annual International Conference on Computing and Combinatorics, COCOON'96, pages 152-161. Springer-Verlag, Lecture Notes in Computer Science, vol. 1090, 1996.
44. [CFFK96] Gruia Cǎlinescu, Cristina G. Fernandes, Ulrich Finkler, and Howard Karloff. A Better Approximation Algorithm for Finding Planar Subgraphs. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96, pages 16-25, 1996.
45. [CFFK98] Gruia Cǎlinescu, Cristina G. Fernandes, Ulrich Finkler, and Howard Karloff. A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms, 27:269-302, 1998.
46. [CGP98] Zhi-Zhong Chen, Michelangelo Grigni, and Christos H. Papadimitriou. Planar Map Graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98, pages 514-523, 1998.
47. 5-free Graphs. In Friedhelm Meyer auf der Heide and Burkhard Monien, editors, Proceedings of the 23rd International Colloquium on Automata, Languages and Programming ICALP'96, pages 269-279. Springer-Verlag, Lecture Notes in Computer Science, vol. 1099, 1996.
48. 3,3-Free Graphs. J. Algorithms, 26:166-187, 1998.
49. [CHT93] Leizhen Cai, Xiaofeng Han, and Robert E. Tarjan. An O(mlog n)-time algorithm for the maximal planar subgraph problem. SIAM J. Comput., 22:1142-1162, 1993.
50. [Cim92] Robert J. Cimikowski. Graph Planarization and Skewness. In Proc. 23rd Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA, February 3-7, 1992, part 1, volume 88 of Congressus Numerantium, pages 21-32, 1992.
51. [Cim94] Robert J. Cimikowski. Branch-and-bound techniques for the maximum planar subgraph problem. Intern. J. Computer Math., 53:135-147, 1994.
52. [Cim95a] Robert J. Cimikowski. An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95, pages 322-331, 1995.
53. [Cim95b] Robert J. Cimikowski. On Heuristics for Determining the Thickness of a Graph. Information Sciences, 85:87-98, 1995.
54. [Cim97] Robert J. Cimikowski. An analysis of heuristics for graph planarization. J. Inf. Optimization Sci., 18:49-73, 1997.
55. [CK93] Jianer Chen and Arkady Kanevsky. On Assembly of Four-Connected Graphs. In Ernst W. Mayr, editor, Proceedings 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'92, pages 158-169. Springer-Verlag, Lecture Notes in Computer Science, vol. 657, 1993. Extended Abstract.
56. [CL96] Gary Chartrand and Linda Lesniak. Graphs & Digraphs. Chapman & Hall, 3rd edition, 1996.
57. [CLR87] Fan R.K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Alg. Disc. Meth., 8:33-58, 1987.
58. [CLR94] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill, 1994.
59. [CNAO85] Norishige Chiba, Takao Nishizeki, Shigenobu Abe, and Takao Ozawa. A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. J. Computer and System Sciences, 30:54-76, 1985.
60. [CNS79] Toru Chiba, Ikuo Nishioka, and Isao Shirakawa. An algorithm of maximal planarization of graphs. In Proceedings IEEE Symposium on Circuits & Systems, ISCAS, 1979, pages 649-652, 1979.
61. [Com92] F. Comellas. Using genetic algorithms for planarization problems. In Computational and applied mathematics, I. Algorithms and theory, Sel. Rev. Pap. IMACS 13th World Congr., Dublin/Irel. 1991, pages 93-100, 1992.
62. [DEH00] Michael B. Dillencourt, David Eppstein, and Daniel S. Hirschberg. Geometric Thickness of Complete Graphs. Journal of Graph Algorithms and Applications, 4:5-17, 2000.
63. [DETT94] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry, 4:235-282, 1994.
64. [DETT99] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing. Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
65. [dFdM96] Hubert de Fraysseix and Patrice Ossona de Mendez. Planarity and edge poset dimension. Europ. J. Combinatorics, 17:731-740, 1996.
66. [DFF85] M.E. Dyer, L.R. Foulds, and A.M. Frieze. Analysis of heuristics for finding a maximum weight planar subgraph. European J. of Operational Research, 20:102-114, 1985.
67. [dFPP90] Hubert de Fraysseix, János Pach, and Richard Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
68. [DHS91] Alice M. Dean, Joan P. Hutchinson, and Edward R. Scheinerman. On the Thickness and Arboricity of a Graph. J. of Combinatorial Theory, Series B, 52:147-151, 1991.
69. [Dji84] Hristo N. Djidjev. On some properties of nonplanar graphs. Comptes rendus de l'Académie Bulgare des Sciences: Sciences mathématiques et naturelles, 37:1183-1184, 1984.
70. [Dji85] Hristo N. Djidjev. A linear algorithm for partitioning graphs of fixed genus. SERDICA Bulgaricae mathematicae publications, 11:369-387, 1985.
71. [Dji95] Hristo N. Djidjev. A Linear Algorithm for the Maximal Planar Subgraph Problem. In Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, and Nicola Santoro, editors, Proceedings 4th International Workshop on Algorithms and Datastructures, WADS'95, pages 369-380. Springer-Verlag, Lecture Notes in Computer Science, vol. 955, 1995.
72. [DR91] Hristo N. Djidjev and John H. Reif. An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. In Proceedings of the 23th Annual ACM Symposium on Theory of Computing, STOC'91, pages 337-347, 1991.
73. 4. J. of Graph Theory, 19:125-129, 1995.
74. [DT89] Giuseppe Di Battista and Roberto Tamassia. Incremental Planarity Testing. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS'89, pages 436-441, 1989.
75. [DT90] Giuseppe Di Battista and Roberto Tamassia. On-Line Graph Algorithms with SPQR-Trees. In Michael S. Paterson, editor, Proceedings of the 17th International Colloquium on Automata, Languages and Programming ICALP'90, pages 598-611. Springer-Verlag, Lecture Notes in Computer Science, vol. 443, 1990.
76. [DT96a] Giuseppe Di Battista and Roberto Tamassia. On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica, 15:302-318, 1996.
77. [DT96b] Giuseppe Di Battista and Roberto Tamassia. On-Line Planarity Testing. SIAM J. Comput., 25(5):956-997, 1996.
78. [dV90] Yves Colin de Verdière. Sur un Nouvel Invariant des Graphes et un Critère de Planarité. J. of Combinatorial Theory, Series B, 50:11-21, 1990.
79. [dV93] Yves Colin de Verdière. On a New Graph Invariant and a Criterion for Planarity. In Neil Robertson and Paul Seymour, editors, Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, Seattle, Washington, USA, June 22 - July 5, 1991, volume 147 of Contemporary Mathematics, pages 137-147. American Mathematical Society, 1993.
80. [DV95] Hristo N. Djidjev and Shankar M. Venkatesan. Planarization of graphs embedded on surfaces. In Manfred Nagl, editor, Proceedings 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'95, pages 62-72. Springer-Verlag, Lecture Notes in Computer Science, vol. 1017, 1995.
81. [EFG82] Peter Eades, L.R. Foulds, and J.W. Giffin. An efficient heuristic for identifying a maximum weight planar subgraph. In Combinatorial Mathematics IX, Proceedings 9th Australian Conference, Brisbane, Australia, 1981, pages 239-251. Springer-Verlag, Lecture Notes in Mathematics, vol. 952, 1982.
82. [ELMM95] Peter Eades, Cláudio L. Lucchesi, João Meidanis, and Candido Ferreira Xavier de Mendonça Neto. NP-hardness Results for Tension-Free Layout. Technical Report DCC-95-15, Departamento de Ciência da Computação, Instituto de Matemaática, Estatística e Ciência da Computação, Universidade Estadual de Campinas, Brazil, 1995.
83. [EM93] Peter Eades and Candido Ferreira Xavier de Mendonça Neto. Heuristics for Planarization by Vertex Splitting. In Giuseppe Di Battista, Peter Eades, Hubert de Fraysseix, Pierre Rosenstiehl, and Roberto Tamassia, editors, ALCOM International Workshop on Graph Drawing, GD'93, Paris, France, September 25-29, 1993, pages 83-85. Available electronically at ftp://ftp.cs.brown.edu/ pub/gd94/gd-92-93/gd93-v2.ps.Z, 1993.
84. [EM96] Peter Eades and Candido Ferreira Xavier de Mendonça Neto. Vertex Splitting and Tension-Free Layout. In Franz J. Brandenburg, editor, Graph Drawing. Proceedings of the DIMACS International Workshop, GD'95, pages 202-211. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.
85. [ET76] Shimon Even and Robert E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
86. [Eve79] Shimon Even. Graph algorithms. Computer Software Engineering Series. Computer Science Press, 1979.
87. [Fár48] István Fáry. On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Institutum Bolyainum, Universitatis Szegediensis), 11:229-233, 1948.
88. [FCE95] Qing-Wen Feng, Robert F. Cohen, and Peter Eades. Planarity for Clustered Graphs. In Paul Spirakis, editor, Third European Symposium on Algorithms, ESA'95, pages 213-226. Springer-Verlag, Lecture Notes in Computer Science, vol. 979, 1995.
89. [FF00] Luérbio Faria and Celina Miraglia Herrera de Figueiredo. On Eggleton and Guy conjectured upper bound for the crossing number of the n-cube. Math. Slovaca, 50:271-287, 2000.
90. [FFM98a] Luérbio Faria, Celina Miraglia Herrera de Figueiredo, and Candido Ferreira Xavier de Mendonça Neto. Splitting Number is NP-Complete. In Juraj Hromkovič and Ondrej Sýkora, editors, Proceedings 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, pages 285-297. Springer-Verlag, Lecture Notes in Computer Science, vol. 1517, 1998.
91. [FFM98b] Luérbio Faria, Celina Miraglia Herrera de Figueiredo, and Candido Ferreira Xavier de Mendonça Neto. The Splitting Number of the 4-Cube. In Cláudio L. Lucchesi and Arnaldo V. Moura, editors, Theoretical Informatics. Proceedings of the 3rd Latin American Symposium, LATIN'98, pages 141-150. Springer-Verlag, Lecture Notes in Computer Science, vol. 1380, 1998.
92. [FFM01] Luérbio Faria, Celina Miraglia Herrera de Figueiredo, and Candido Ferreira Xavier de Mendonça Neto. Splitting number is NP-complete. Discrete Applied Math., 108:65-83, 2001.
93. [FGG85] L.R. Foulds, P.B. Gibbons, and J.W. Giffin. Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics. Operations Research, 33:1091-1106, 1985.
94. [Fio86] S. Fiorini. On the crossing number of generalized Petersen graphs. In Proceedings Int. Conf. Finite Geom. Comb. Struct., Bari, Italy, 1984, Combinatorics '84, pages 225-241. North-Holland, Annals of Discrete Mathematics, vol. 30, 1986.
95. [FMN94] Steve Fisk, Bojan Mohar, and Roman Nedela. Minimal Locally Cyclic Triangulations of the Projective Plane. J. of Graph Theory, 18:25-35, 1994.
96. [Fou92] L.R. Foulds. Graph Theory Applications. Springer, 1992.
97. [FR78] L.R. Foulds and David F. Robinson. Graph Theoretic Heuristics for the Plant Layout Problem. International J. of Production Research, 16:27-37, 1978.
98. [FR95] T. Feo and Mauricio G.C. Resende. Greedy randomized adaptive search procedures. J. of Global Optimization, 6:109-133, 1995.
99. [Gav73] Fanika Gavril. Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph. Networks, 3:261-273, 1973.
100. [GB68] Richard K. Guy and Lowell W. Beineke. The coarseness of the complete graph. Can. J. Math., 20:888-894, 1968.
101. [GH73] Richard K. Guy and Anthony Hill. The crossing number of the complement of a circuit. Discrete Mathematics, 5:335-344, 1973.
102. [Gib85] Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
103. [GJ79] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman & Co Ltd, 1979.
104. [GJ83] Michael R. Garey and David S. Johnson. Crossing Number is NPComplete. SIAM J. Alg. Disc. Meth., 4:312-316, 1983.
105. [GJS76] Michael R. Garey, David S. Johnson, and Larry Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
106. [GM84] Michel Gondran and Michel Minoux. Graphs and algorithms. Wiley, 1984.
107. [Gol63] A.J. Goldstein. An Efficient and Constructive Algorithm for Testing Wether a Graph Can Be Embedded in a Plane. In Graph and Combinatorics Conference, Contract No. NONR 1858-(21), Office of Naval Research Logistics Proj., Dept. of Mathematics, Princeton University, May 16-18, 1963, 1963.
108. [Gol80] Martin C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, 1980.
109. [Grü67] Banko Grünbaum. Convex Polytopes. Interscience Publishers, a divsion of John Wiley & Sons, 1967.
110. [GT87] Jonathan L. Gross and Thomas W. Tucker. Topological graph theory. Wiley, 1987.
111. [GT94] Oliver Goldschmidt and Alexan Takvorian. An efficient graph planarization two-phase heuristic. Networks, 24:69-73, 1994.
112. [Gub93] Bradley S. Gubser. Planar graphs with no 6-wheel minor. Discrete Mathematics, 120:59-73, 1993.
113. [Guy69] Richard K. Guy. The decline and fall of Zarankiewicz's theorem. In Frank Harary, editor, Proof Techniques in Graph Theory. Proceedings of the Second Ann Arbor Graph Theory Conference, February 1968, pages 63-69. Academic Press, New York, 1969.
114. [Guy71] Richard K. Guy. Latest results on crossing numbers. In Michael Capobianco, Joseph B. Frechen, and M. Krolik, editors, Recent Trends in Graph Theory, Proceedings of the First New York City Graph Theory Conference, June 11-13, 1970, pages 143-156. Springer-Verlag, Lecture Notes in Mathematics, vol. 186, 1971.
115. [Guy72] Richard K. Guy. Crossing Numbers of Graphs. In Y. Alavi, D.R. Lick, and Arthur T. White, editors, Graph Theory and Applications, pages 111-124. Proceedings of the Conference at Western Michigan University, May 10-13, 1972, Springer-Verlag, Lecture Notes in Mathematics, vol. 303, 1972.
116. [Hal43] Dick Wick Hall. A Note on Primitive Skew Curves. Bulletin of the American Mathematical Society, 49:935-936, 1943.
117. [Hal91] John H. Halton. On the Thickness of Graphs of Given Degree. Information Sciences, 54:219-238, 1991.
118. [Har69] Frank Harary. Graph theory. Addison-Wesley Publishing Company, 1969.
119. [Har79] Jehuda Hartman. Bounds on the Coarseness of the n-Cube. Canad. Math. Bull., 22:171-175, 1979.
120. n. Discrete Mathematics, 62:35-47, 1986.
121. [Har87] Nora Hartsfield. The splitting number of the complete graph in the projective plane. Graphs and Combinatorics, 3:349-356, 1987.
122. [Hea90] P.J. Heawood. Map Colour Theorem. Quart. J. Math., 24:332-338, 1890.
123. [Hea84] Lenny Heath. Embedding Planar Graphs in Seven Pages. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, FOCS'84, pages 74-83, 1984.
124. [Hea87] Lenwood S. Heath. Embedding outerplanar graphs in small books. SIAM J. Alg. Disc. Meth., 8:198-218, 1987.
125. [HG68a] Arthur M. Hobbs and J.W. Grossman. A Class of Thickness-Minimal Graphs. J. of Research of the National Bureau of Standards - B. Mathematical Sciences, 72B:145-153, 1968.
126. [HG68b] Arthur M. Hobbs and J.W. Grossman. Thickness and connectivity in graphs. J. of Research of the National Bureau of Standards - B. Mathematical Sciences, 72B:239-244, 1968.
127. [HHW88] Frank Harary, John P. Hayes, and Horng-Jyh Wu. A survey of the theory of hypercube graphs. Comput. Math. Applic., 15:277-289, 1988.
128. [HI92] Lenwood S. Heath and Sorin Istrail. The pagenumber of genus g graphs is O(g). J. of the Association for Computing Machinery, 39:479-501, 1992.
129. [HJR85] Nora Hartsfield, Brad Jackson, and Gerhard Ringel. The splitting number of the complete graph. Graphs and Combinatorics, 1:311-329, 1985.
130. [HM87] Joan P. Hutchinson and Gary L. Miller. On deleting vertices to make a graph of positive genus planar. In David S. Johnson, editor, Discrete algorithms and complexity. Proc. of the Japan-US joint seminar, Kyoto, Japan, June 4-6, 1986, pages 81-98, 1987.
131. [Hob69] Arthur M. Hobbs. A survey of thickness. In William T. Tutte, editor, Recent progress in combinatorics. Proceedings of the 3rd Waterloo Conference on Combinatorics, May 20-31, 1968, pages 255-264. Academic Press, New York, 1969.
132. [Hor83] Peter Horák. Solution of four problems from Eger, 1981. I. In Miroslav Fiedler, editor, Graphs and Other Combinatorial Topics. Proceedings of the Third Czechoslovak Symposium on Graph Theory, Prague, August 24- 27, 1982, pages 115-117. Teubner, Texte zur Mathematik, vol. 59, 1983.
133. [HŠ82] Peter Horák and Jozef Širáň. On a Modified Concept of Thickness of a Graph. Math. Nachr., 108:305-306, 1982.
134. [HŠ87] Peter Horák and Jozef Širáň. A construction of thickness-minimal graphs. Discrete Mathematics, 64:263-268, 1987.
135. [Hsu95] Wen-Lian Hsu. A linear time algorithm for finding maximal planar subgraphs. In John Staples, Peter Eades, Naoki Katoh, and Alistair Moffat, editors, Algorithms and Computation, 6th International Symposium, ISAAC'95, pages 352-361. Springer-Verlag, Lecture Notes in Computer Science, vol. 1004, 1995.
136. [HSV96] Joan P. Hutchinson, Thomas Shermer, and Andrew Vince. On Representations of Some Thickness-Two Graphs. In Franz J. Brandenburg, editor, Graph Drawing. Proceedings of the DIMACS International Workshop, GD'95, pages 324-332. Springer-Verlag, Lecture Notes in Computer Science, vol. 1027, 1996.
137. [HSV99] Joan P. Hutchinson, Thomas Shermer, and Andrew Vince. On representations of some thickness-two graphs. Computational Geometry, 13:161-171, 1999.
138. [HT65] Frank Harary and William T. Tutte. A dual form of Kuratowski's theorem. Canad. Math. Bull., 8:17-20, 1965.
139. [HT74] John E. Hopcroft and Robert E. Tarjan. Efficient planarity testing. J. of the Association for Computing Machinery, 21:549-568, 1974.
140. [Hut89] Joan P. Hutchinson. On genus-reducing and planarizing algorithms for embedded graphs. In R. Bruce Richter, editor, Graphs and algorithms, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Boulder, Colorado, USA, June 28 - July 4, 1987, volume 89 of Contemporary Mathematics, pages 19-26. American Mathematical Society, 1989.
141. [JLM97] Michael Jünger, Sebastian Leipert, and Petra Mutzel. Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In Giuseppe Di Battista, editor, Proceedings of the Symposium on Graph Drawing, GD'97, pages 193-204. Springer-Verlag, Lecture Notes in Computer Science, vol. 1353, 1997.
142. [JLMO97] Michael Jünger, Eva K. Lee, Petra Mutzel, and Thomas Odenthal. A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. In Giuseppe Di Battista, editor, Proceedings of the Symposium on Graph Drawing, GD'97, pages 13-24. Springer-Verlag, Lecture Notes in Computer Science, vol. 1353, 1997.
143. [JM96] Michael Jünger and Petra Mutzel. Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica, 16:33-59, 1996.
144. [JM97] Michael Jünger and Petra Mutzel. 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications, 1:1-25, 1997.
145. 5-Minors. Technical Report 94.168, Universität zu Köln, 1994. Available electronically at ftp://ftp.ZPR.unikoeln. de/pub/paper/zpr94-168.ps.gz.
146. [JMOS98] Michael Jünger, Petra Mutzel, Thomas Odenthal, and Mark Scharbrodt. The Thickness of a Minor-Excluded Class of Graphs. Discrete Mathematics, 182:169-176, 1998.
147. [Joh85] David S. Johnson. The NP-Completeness Column: An Ongoing Guide. J. Algorithms, 6:434-451, 1985.
148. [JR84a] Brad Jackson and Gerhard Ringel. Plane constructions for graphs, networks, and maps measurements of planarity. In Selected topics in operations research and mathematical economics, Proc. 8th Symp., Karlsruhe 1983, pages 315-324. Springer-Verlag, Lecture Notes in Economics and Mathematical Systems, vol. 226, 1984.
149. [JR84b] Brad Jackson and Gerhard Ringel. The splitting number of complete bipartite graphs. Arch. Math., 42:178-184, 1984.
150. [JR85] Brad Jackson and Gerhard Ringel. Splittings of graphs on surfaces. In Frank Harary, editor, Graphs and applications, Proceedings of the 1st Colorado Symposium on Graph Theory, Boulder, Colorado, 1982, pages 203-219, 1985.
151. n. Casopis pro pestovan i matematiky, 107:225-230, 1982.
152. 2) Algorithms for Graph Planarization. In Jan v. Leeuwen, editor, Proceedings 14th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'88, pages 352-377. Springer-Verlag, Lecture Notes in Computer Science, vol. 344, 1989.
153. [JT95] Tommy R. Jensen and Bjarne Toft. Graph Coloring Problems. Wiley, 1995.
154. 2) Algorithms for Graph Planarization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 8:257-267, 1989.
155. p,q, and Q(d). J. of Combinatorial Theory, Series B, 12:287-298, 1972.
156. [Kai72b] Paul C. Kainen. On the stable crossing number of cubes. Proceedings of the American Mathematical Society, 36:55-62, 1972.
157. [Kai73] Paul C. Kainen. Thickness and Coarseness of Graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 39:88-95, 1973.
158. [Kai90] Paul C. Kainen. The book thickness of a graph, II. In Proc. 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, USA, 1989, volume 71 of Congressus Numerantium, pages 127-132, 1990.
159. 2) Maximal Planarization Algorithm based on PQ-trees. Technical Report RUU-CS-92-03, Dept. of Comp. Science, Utrecht University, 1992.
160. [Kan93] Goos Kant. Algorithms for Drawing Planar Graphs. University of Utrecht, 1993. PhD Thesis.
161. [Kar72] Richard M. Karp. Reducibility Among Combinatorial Problems. In Raymond E. Miller and J.W. Thatcher, editors, Complexity of computer computations. Proceedings of a Symposium on the Complexity of Computer Computations, IBM Thomas J.Watson Research Center, Yorktown Heights, New York, March 20-22, 1972, pages 85-103. Plenum Press, New York, 1972.
162. [KD79] M.S. Krishnamoorthy and Narsingh Deo. Node-deletion NP-complete problems. SIAM J. Comput., 8:619-625, 1979.
163. [Kel93] Alexander K. Kelmans. Graph planarity and related topics. In Neil Robertson and Paul Seymour, editors, Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, Seattle, Washington, USA, June 22 - July 5, 1991, volume 147 of Contemporary Mathematics, pages 635-667. American Mathematical Society, 1993.
164. [KH78] Bernhard Korte and Dirk Hausmann. An Analysis of the Greedy Heuristic for Independence Systems. In Brian R. Alspach, editor, Algorithmic Aspects of Combinatorics, pages 65-74. North-Holland, Annals of Discrete Mathematics, vol. 2, 1978.
165. 3,3-Free Graphs. Information and Computation, 84:13-25, 1990.
166. [KJ83] Kazimierz Kuratowski and Jan Jaworowski. On the problem of skew curves in topology. In M. Borowiecki, J.W. Kennedy, and Maciej M. Sysło, editors, Graph Theory, Proc. of a Conference held in Łagów, Poland, February 10-13, 1981, pages 1-13. Springer-Verlag, Lecture Notes in Mathematics, vol. 1018, 1983. Translation of [Kur30] by Jan Jaworowski.
167. [Kle67] Michael Kleinert. Die Dicke des n-dimensionalen Würfel-Graphen. J. of Combinatorial Theory, 3:10-15, 1967.
168. 5,n. J. of Combinatorial Theory, 9:315-323, 1970.
169. [Kle91] Marián Klešč. On the crossing numbers of Cartesian products of stars and paths or cycles. Math. Slovaca, 41(2):113-120, 1991.
170. [Kle94] Marián Klešč. The Crossing Numbers of Products of Paths and Stars with 4-Vertex Graphs. J. of Graph Theory, 18:605-614, 1994.
171. [Kle95] Marián Klešč. The crossing numbers of certain Cartesian products. Discussiones Mathematicae - Graph Theory, 15:5-10, 1995.
172. n. Tatra Mountains Math. Publ., 9:51-56, 1996.
173. 5 minor. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92, pages 345-356, 1992.
174. [Koc87] Martin Kochol. Construction of crossing-critical graphs. Discrete Mathematics, 66:311-313, 1987.
175. [Koc91] Martin Kochol. Linear Jump of Crossing Number for Non Kuratowski Edge of a Graph. Radovi Matematicki, 7:177-184, 1991.
176. [Kön36] Dénes König. Theorie der endlichen und unendlichen Graphen. Kombinatorische Topologie der Streckenkomplexe. Akademische Verlagsgesellschaft, Leipzig, 1936.
177. [Kön90] Dénes König. Theory of Finite and Infinite Graphs. Birkhäuser, 1990. Originally published in 1936 as Theorie der endlichen und unendlichen Graphen. With a commentary by William T. Tutte.
178. n. J. of Graph Theory, 22:239-243, 1996.
179. [Kur30] Kazimierz Kuratowski. Sur le problème des courbes gauches en topologie. Fundamenta Mathematicae, 15:271-283, 1930.
180. [KW78] Paul C. Kainen and Arthur T. White. On Stable Crossing Numbers. J. of Graph Theory, 2:181-187, 1978.
181. [La 94] J.A. La Poutré. Alpha-Algorithms for Incremental Planarity Testing. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94, pages 706-715, 1994.
182. [LEC67] A. Lempel, Shimon Even, and I. Cederbaum. An Algorithm for Planarity Testing of Graphs. In Pierre Rosenstiehl, editor, Theory of Graphs. International Symposium, Rome, Italy, July 1966, pages 215-232, New York, 1967. Gordon and Breach.
183. [Lee90] Jan v. Leeuwen. Graph Algorithms. In Jan v. Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pages 525-631. Elsevier Science Pub., Amsterdam, 1990.
184. [Lei81] Frank Thomson Leighton. New Lower Bound Techniques for VLSI. In Proceedings of the 22th Annual Symposium on Foundations of Computer Science, FOCS'81, pages 1-12, 1981.
185. [Lei83] Frank Thomson Leighton. Complexity Issues in VLSI. MIT Press, 1983.
186. [Lei84] Frank Thomson Leighton. New Lower Bound Techniques for VLSI. Math. Systems Theory, 17:47-70, 1984.
187. [Lei94] Sebastian Leipert. The Problem of Computing a Maximal Planar
188. [Len89] Thomas Lengauer. Hierarchical Planarity Testing Algorithms. J. of the Association for Computing Machinery, 36:474-509, 1989.
189. [Leu92] Janny Leung. A new graph-theoretic heuristic for facility layout. Management Science, 38:594-605, 1992.
190. [LG79] P.C. Liu and R.C. Geldmacher. On the Deletion of Nonplanar Edges of a Graph. In Proc. of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, USA, 1979, part 2, volume 24 of Congressus Numerantium, pages 727-738, 1979.
191. [Lic82] D. Lichtenstein. Planar Formulae and their Uses. SIAM J. Comput., 11:329-343, 1982.
192. [LY80] John M. Lewis and Mihalis Yannakakis. The Node-Deletion Problem for Hereditary Properties is NP-Complete. J. Computer and System Sciences, 20:219-230, 1980.
193. [Mac37] S. MacLane. A combinatorial condition for planar graphs. Fundamenta Mathematicae, 28:22-32, 1937.
194. [Mad91] Tom Madej. Bounds for the Crossing Number of the N-Cube. J. of Graph Theory, 15:81-97, 1991.
195. [Mal94] Seth M. Malitz. Graphs with E Edges Have Pagenumber O(√E). J. Algorithms, 17:71-84, 1994.
196. [Man83] Anthony Mansfield. Determining the thickness of graphs is NP-hard. Math. Proc. Camb. Phil. Soc., 93:9-23, 1983.
197. [ME93a] Matthias Mayer and Fikret Ercal. Genetic Algorithms For Vertex Splitting in DAGs. Technical Report CSC-93-02, Computer Science Department, University of Missouri-Rolla, MO 65401, USA, January 1993. Presented as a poster at The Fifth Int'l Conf. on Genetic Algorithms (ICGA-93). Available electronically at http://www.cs.umr.edu/techrpt/postscript/93-02.ps.
198. [ME93b] Matthias Mayer and Fikret Ercal. Parallel Genetic Algorithms For the DAG Vertex Splitting Problem. Technical Report CSC-93-10, Computer Science Department, University of Missouri-Rolla, MO 65401, USA, May 1993.
199. [Meh84] Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer, 1984.
200. [Men94] Candido Ferreira Xavier de Mendonça Neto. A Layout System for Information System Diagrams. PhD thesis, University of Queensland, Australia, March 1994. Technical Report No. 94-01, Department of Computer Science, The University of Newcastle, Australia.
201. [Mic83] Danuta Michalak. On middle and total graphs with coarseness number equal 1. In M. Borowiecki, J.W. Kennedy, and Maciej M. Sysło, editors, Graph Theory, Proc. of a Conference held in Łagów, Poland, February 10-13, 1981, pages 139-150. Springer-Verlag, Lecture Notes in Mathematics, vol. 1018, 1983.
202. [MKNF87] Sumio Masuda, Toshinobu Kashiwabara, Kazuo Nakajima, and Toshio Fujisawa. On the NP-completeness of a computer network layout problem. In Proceedings of the 1987 IEEE International Symp. on Circuits and Systems, pages 292-295, 1987.
203. [MLW88] Douglas Muder, Margaret Lefevre Weaver, and Douglas B. West. Pagenumber of Complete Bipartite Graphs. J. of Graph Theory, 12:469-489, 1988.
204. [MM92] Aleksander Malnič and Bojan Mohar. Generating locally-cyclic triangulations of surfaces. J. of Combinatorial Theory, Series B, 56:147-164, 1992.
205. [MM96] Kurt Mehlhorn and Petra Mutzel. On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica, 16:233-242, 1996.
206. [MMN93] Kurt Mehlhorn, Petra Mutzel, and Stefan Näher. An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm. Technical Report MPI-I-93-151, Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany, 1993. Available electronically at http://www.mpi-sb.mpg.de/~mutzel/mpireports/MPI-I-93-151.ps. gz.
207. [MNKF90] Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, and Toshio Fujisawa. Crossing Minimization in Linear Embeddings of Graphs. IEEE Transactions on Computers, 39(1):124-127, 1990.
208. [Moh96] Bojan Mohar. Embedding Graphs in an Arbitrary Surface in Linear Time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96, 1996.
209. [MOS98] Petra Mutzel, Thomas Odenthal, and Mark Scharbrodt. The Thickness of Graphs: A Survey. Graphs and Combinatorics, 14:59-73, 1998.
210. 3,3-free Graphs. Technical report, Technion - Israel Institute of Technology, September 1995.
211. [MR92] Dan McQuillan and R. Bruce Richter. On the crossing numbers of certain generalized Petersen graphs. Discrete Mathematics, 104:311-320, 1992.
212. [MR94] Dan McQuillan and R. Bruce Richter. On 3-Regular Graphs Having Crossing Number at least 2. J. of Graph Theory, 18:831-839, 1994.
213. [Mut94] Petra Mutzel. The Maximum Planar Subgraph Problem. PhD thesis, Universität zu Köln, 1994. The Introduction and the Table of Contents are available electronically at http://www.mpisb.mpg.de/~mutzel/koelnreports/.
214. [NC88] Takao Nishizeki and Norishige Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics. North-Holland, 1988.
215. [Nis90] Takao Nishizeki. Planar graph problems. In Gottfried Tinhofer, Ernst W. Mayr, Hartmut Noltemeier, and Maciej M. Sysło, editors, Computational Graph Theory, volume 7 of Computing Supplementum, pages 53-68. Springer-Verlag Wien New York, 1990.
216. 3,3-free Digraphs. Technical report, Technion - Israel Institute of Technology, June 1994.
217. [NW79] Crispin St.J.A. Nash-Williams. Acyclic detachments of graphs. In Robin J. Wilson, editor, Proceedings of the Conference in Combinatorics and Graph Theory, The Open University, England, May 12, 1978, Research Notes in Mathematics, pages 87-97. Pitman Publishing Limited, 1979.
218. [NW85a] Crispin St.J.A. Nash-Williams. Connected detachments of graphs and generalized Euler trails. J. London Math. Soc. (2), 31:17-29, 1985.
219. [NW85b] Crispin St.J.A. Nash-Williams. Detachments of graphs and generalised Euler trails. In Ian Anderson, editor, Surveys in Combinatorics 1985, Pap. 10th British Combinatorial Conference, Glasgow, Scotland, 1985, volume 103 of London Mathematical Society Lecture Note Series, pages 137-151. Cambridge Univ. Press, Cambridge-New York, 1985.
220. [NW87] Crispin St.J.A. Nash-Williams. Amalgamations of almost regular edge-colourings of simple graphs. J. of Combinatorial Theory, Series B, 43:322-342, 1987.
221. [Obr93] Bojana Obrenić. Embedding de Bruijn and shue-exchange graphs in five pages. SIAM J. Discrete Math., 6:642-654, 1993.
222. [Ode94] Thomas Odenthal. Die Schichtzahl von Graphen. Master's thesis, Institut für Informatik, Universität zu Köln, 1994.
223. [OS94] Thomas Odenthal and Mark Scharbrodt. Maximal Planarization as a Tool for Approximating Thickness and Crossing Number. In Student Proceedings 8th Conference of the European Consortium for Mathematics in Industry, ECMI'94, Kaiserslautern, Germany, 1994, pages 137-151, 1994.
224. [OT81] Takao Ozawa and H. Takahashi. A graph-planarization algorithm and its application to random graphs. In N. Saito and Takao Nishizeki, editors, Proceedings of the 17th Symposium, Research Institute of Electrical Communication,Tohoku University, Sendai, Japan, October 24-25, 1980, pages 95-107. Springer-Verlag, Lecture Notes in Computer Science, vol. 108, 1981.
225. [Pap94] Christos H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, 1994.
226. [PCK89] Y.H. Peng, C.C. Chen, and K.M. Koh. On the Factor-Thickness of Regular Graphs. Graphs and Combinatorics, 5:173-188, 1989.
227. [PPV86] Giustina Pica, Tomaž Pisanski, and Aldo G.S. Ventre. Cartesian products of graphs and their crossing numbers. In Proceedings Int. Conf. Finite Geom. Comb. Struct., Bari, Italy, 1984, Combinatorics '84, pages 339- 346. North-Holland, Annals of Discrete Mathematics, vol. 30, 1986.
228. [PSS94] János Pach, Farhad Shahrokhi, and Mario Szegedy. Applications of the Crossing Number. In Proceedings of the 10th ACM Symposium on Computational Geometry, SCG'94, Stony Brook, New York, USA, June 6-8, 1994, pages 198-202. The Association for Computing Machinery, New York, 1994.
229. [PSS96] János Pach, Farhad Shahrokhi, and Mario Szegedy. Applications of the Crossing Number. Algorithmica, 16:111-117, 1996.
230. [PT97] János Pach and Géza Tóth. Graphs drawn with few crossings per edge. Combinatorica, 17:427-439, 1997.
231. [PT98] János Pach and Géza Tóth. Which crossing number is it, anyway? In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS'98, pages 617-626, 1998.
232. n. J. of Combinatorial Theory, Series B, 24:134-136, 1978.
233. [Ric88] R. Bruce Richter. Cubic Graphs with Crossing Number Two. J. of Graph Theory, 12:363-374, 1988.
234. [Rin65] Gerhard Ringel. Die toroidale Dicke des vollständigen Graphen. Math. Z., 87:19-26, 1965.
235. [RL92] Subramanian Ramanathan and Errol L. Lloyd. Scheduling algorithms for multihop radio networks. ACM SIGCOMM Computer Communication Review, 22:211-222, 1992.
236. [RL93] Subramanian Ramanathan and Errol L. Lloyd. Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking, 1:166-177, 1993.
237. [RLWW97] Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe. The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput., 26:331-349, 1997.
238. [RR97] Mauricio G.C. Resende and Celso C. Ribeiro. A GRASP for Graph Planarization. Networks, 29:173-189, 1997.
239. [RR98] Mauricio G.C. Resende and Celso C. Ribeiro. Graph planarization, 1998. Available electronically at http://www.research.att.com/~mgcr/doc/splanar. ps.Z.
240. 3,n in a Surface. J. of Graph Theory, 21:51-54, 1996.
241. [RSST96] Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas. A new proof of the four-colour theorem. ERA Amer. Math. Soc., 2(1):17-25, 1996. Available electronically at http://www.ams.org/era/1996-02-01/ .
242. [RT85] J. Roskind and Robert E. Tarjan. A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research, 10:701-708, 1985.
243. [RT93] R. Bruce Richter and Carsten Thomassen. Minimal graphs with crossing number at least k. J. of Combinatorial Theory, Series B, 58:217-224, 1993.
244. 5. Discrete Comput. Geom., 13:149-159, 1995.
245. [RT97] R. Bruce Richter and Carsten Thomassen. Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs. The American Mathematical Monthly, 104:131-137, 1997.
246. [RZ95] Jürgen Richter-Gebert and Günter M. Ziegler. Realization spaces of 4-polytopes are universal. Bulletin (New Series) of the American Mathematical Society, 32:403-412, 1995. Research report.
247. [SC89] Ranjan Kumar Sen and Pranay Chaudhuri. A parallel approximate algorithm for minimum edge deletion bipartite subgraph problem. J. of Combinatorics, Information & System Sciences, 14:111-123, 1989.
248. [Sch86] Karl Schaffer. The Splitting Number and Other Topological Parameters of Graphs. PhD thesis, University of California at Santa Cruz, January 1986.
249. [Sch89] Walter Schnyder. Planar Graphs and Poset Dimension. Order, 5:323-343, 1989.
250. [Sch90a] Walter Schnyder. Embedding Planar Graphs on the Grid. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90, pages 138-148, 1990.
251. [Sch90b] H. Schumacher. On 2-Embeddable Graphs. In Topics in Combinatorics and Graph Theory, Essys in Honour of Gerhard Ringel, pages 651-661. Physica Verlag, Heidelberg, 1990.
252. [Sch91] Haijo Schipper. Generating triangulations of 2-manifolds. In Computational geometry - methods, algorithms and applications, Proceedings International Workshop, CG'91, pages 237-248. Springer-Verlag, Lecture Notes in Computer Science, vol. 553, 1991.
253. [Sch95] Mark Scharbrodt. Die Kreuzungszahl von Graphen. Master's thesis, Institut für Informatik, Universität zu Köln, 1995.
254. [Sch97] Alexander Schrijver. Minor-monotone Graph Invariants. In Rosemary A. Bailey, editor, Surveys in Combinatorics 1997, Papers presented by the invited lectures at the 16th British Combinatorial Conference, 1997, volume 241 of London Mathematical Society Lecture Note Series. Cambridge Univ. Press, Cambridge-New York, 1997.
255. [Sel88] S.M. Selim. Split vertices in vertex colouring and their application in developing a solution to the faculty timetable problem. The Computer Journal, 31(1):76-82, 1988.
256. [Sen90] Ranjan Kumar Sen. An approximate algorithm for minimum edge deletion bipartite subgraph problem. In Proc. 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, USA, 1989, volume 74 of Congressus Numerantium, pages 38-54, 1990.
257. [SGB95] R. Swaminathan, D. Giriraj, and D.K. Bhatia. The pagenumber of the class of bandwidth-k graphs is k - 1. Information Processing Letters, 55:71-74, 1995.
258. [SH99] Wei-Kuan Shih and Wen-Lian Hsu. A new planarity test. Theoretical Computer Science, 223:179-191, 1999.
259. [Šir83] Jozef Širáň. Crossing-critical edges and Kuratowski subgraphs of a graph. J. of Combinatorial Theory, Series B, 35:83-92, 1983.
260. [Šir84] Jozef Širáň. Infinite families of crossing-critical graphs with a given crossing number. Discrete Mathematics, 48:129-132, 1984.
261. [SL89] Majid Sarrafzadeh and D.T. Lee. A new approach to topological via minimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 8:890-900, 1989.
262. [Sla74] Peter J. Slater. A Classification of 4-Connected Graphs. J. of Combinatorial Theory, Series B, 17:281-298, 1974.
263. [SR34] Ernst Steinitz and Hans Rademacher. Vorlesungen über die Theorie der Polyeder unter Einschluß der Elemente der Topologie, volume 41 of Die Grundlehren der Mathematischen Wissenschaften. Springer, 1934. Aus dem Nachlaß von Ernst Steinitz herausgegeben und ergänzt von Hans Rademacher.
264. [SS92] Farhad Shahrokhi and László A. Székely. Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry. In Proceedings of the 2nd Conference on Integer Programming and Combinatorial Optimization, IPCO'92, Carnegie-Mellon University, USA, May 25-27, 1992, pages 102-113, 1992.
265. [SS94] Farhad Shahrokhi and László A. Székely. On Canonical Concurrent Flows, Crossing Number and Graph Expansion. Combinatorics, Probability and Computing, 3:523-543, 1994.
266. [SS96] Farhad Shahrokhi and Weiping Shi. Effcient Deterministic Algorithms for Embedding Graphs on Books. In Jin-Yi Cai and Chak Kuen Wong, editors, Proceedings 2nd Annual International Conference on Computing and Combinatorics, COCOON'96, pages 162-168. Springer-Verlag, Lecture Notes in Computer Science, vol. 1090, 1996.
267. [SSSV94] Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, and Imrich Vrt'o. Improved Bounds for the Crossing Numbers on Surfaces of Genus g. In Jan v. Leeuwen, editor, Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'93, pages 388-395. Springer-Verlag, Lecture Notes in Computer Science, vol. 790, 1994.
268. [SSSV95] Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, and Imrich Vrt'o. Book Embeddings and Crossing Numbers. In Ernst W. Mayr, G. Schmidt, and Gottfried Tinhofer, editors, Proceedings 20th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'94, pages 256- 268. Springer-Verlag, Berlin, 1995.
269. [SSSV96a] Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, and Imrich Vrt'o. The Book Crossing Number of a Graph. J. of Graph Theory, 21:413-424,1996.
270. [SSSV96b] Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, and Imrich Vrt'o. Drawings of Graphs on Surfaces with Few Crossings. Algorithmica,16:118-131, 1996.
271. [SSSV97] Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, and Imrich Vrt'o. On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. In Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, and Roberto Tamassia, editors, Proceedings 5th International Workshop on Algorithms and Data Structures, WADS'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, pages 55-68. Springer-Verlag, Lecture Notes in Computer Science, vol. 1272, 1997.
272. n on surfaces. Discrete Comput. Geom., 19:237-247, 1998.
273. [SSSV00] Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, and Imrich Vrt'o. A new lower bound for the bipartite crossing number with applications. Theoretical Computer Science, 245:281-294, 2000.
274. [SSV95] Farhad Shahrokhi, László A. Székely, and Imrich Vrt'o. Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. In Roberto Tamassia and Ioannis G. Tollis, editors, Graph Drawing. Proceedings of the DIMACS International Workshop, GD'94, pages 131-142. Springer-Verlag, Lecture Notes in Computer Science, vol. 894, 1995.
275. [Ste51] S.K. Stein. Convex Maps. Proceedings of the American Mathematical Society, 2:464-466, 1951.
276. [SV92] Ondrej Sýkora and Imrich Vrt'o. On the crossing number of the hypercube and the cube connected cycles. In G. Schmidt and R. Berghammer, editors, Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'91, pages 214-218. Springer-Verlag, Lecture Notes in Computer Science, vol. 570, 1992.
277. [SV93a] Ondrej Sýkora and Imrich Vrt'o. Edge separators for graphs of bounded genus with applications. Theoretical Computer Science, 112:419-429,1993.
278. [SV93b] Ondrej Sýkora and Imrich Vrt'o. On crossing numbers of hypercubes and cube connected cycles. BIT, 33:232-237, 1993.
279. [SV94] Ondrej Sýkora and Imrich Vrt'o. On VLSI layout of the star graph and related networks. INTEGRATION The VLSI Journal, 17:83-93, 1994.
280. [Tho89] Carsten Thomassen. The Graph Genus Problem Is NP-Complete. J. Algorithms, 10:568-576, 1989.
281. [TJS86] K. Thulasiraman, R. Jayakumar, and Madisetti N.S. Swamy. On Maximal Planarization of Nonplanar Graphs. IEEE Transactions on Circuits and Systems, 33:843-844, 1986.
282. [TL89] Yoshiyasu Takefuji and Kuo Chun Lee. A near-optimum parallel planarization algorithm. Science, 245:1221-1223, 1989.
283. 2) Algorithms for Graph Planarization". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10:1582-1583,1991.
284. [Tru92] Klaus Truemper. Matroid decomposition. Academic Press, 1992.
285. [TS92] K. Thulasiraman and Madisetti N.S. Swamy. Graphs: theory and algorithms. Wiley, 1992.
286. [TT97] Hisao Tamaki and Takeshi Tokuyama. A Characterization of Planar Graphs by Pseudo-Line Arrangements. In Algorithms and Computation, 8th International Symposium, ISAAC'97, pages 133-142. Springer-Verlag, Lecture Notes in Computer Science, vol. 1350, 1997.
287. [Tur77] Paul Turán. A Note of Welcome. J. of Graph Theory, 1:7-9, 1977.
288. [Tut61] William T. Tutte. A Theory of 3-Connected Graphs. Indagationes Mathematicae: ex actis quibus titulus "Proceedings of the Section of Science" Koninklijke Nederlandse Akademie van Wetenschappen, 23:441-455, 1961.
289. [Tut63a] William T. Tutte. The non-biplanar character of the complete 9-graph. Canad. Math. Bull., 6:319-330, 1963.
290. [Tut63b] William T. Tutte. The thickness of a graph. Indagationes Mathematicae: ex actis quibus titulus "Proceedings of the Section of Science" Koninklijke Nederlandse Akademie van Wetenschappen, 25:567-577, 1963.
291. [Tut66] William T. Tutte. Connectivity in Graphs, volume 15 of Mathematical Expositions. University of Toronto Press, 1966.
292. [Tut84] William T. Tutte. Graph theory, volume 21 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company, 1984.
293. [Val97] Pavel Valtr. Graph Drawing with no k Pairwise Crossing Edges. In Giuseppe Di Battista, editor, Proceedings of the Symposium on Graph Drawing, GD'97, pages 205-218. Springer-Verlag, Lecture Notes in Computer Science, vol. 1353, 1997.
294. [Val98] Pavel Valtr. On Geometric Graphs with No k Pairwise Parallel Edges. Discrete Comput. Geom., 19:461-469, 1998.
295. [Vas76] J.M. Vasak. The thickness of the complete graph. Notices of the American Mathematical Society, 23:A-479, 1976. Abstract.
296. [Vrt] Imrich Vrt'o. Crossing Numbers of Graphs: A Bibliography. Available electronically at ftp://ifi.savba.sk/pub/imrich/crobib.ps.gz.
297. [Wag36] K. Wagner. Bemerkungen zum Vierfarbenproblem. Jber. d. Dt. Math.-Verein., 46:26-32, 1936.
298. [Wag37a] K. Wagner. Über eine Eigenschaft der ebenen Komplexe. Math. Ann., 114:570-590, 1937.
299. [Wag37b] K.Wagner. Über eine Erweiterung eines Satzes von Kuratowski. Deutsche Mathematik, 2:280-285, 1937.
300. [WAN83] Toshimasa Watanabe, Tadashi Ae, and Akira Nakamura. On the NPhardness of edge-deletion and -contraction problems. Discrete Applied Math., 6:63-78, 1983.
301. [WB78] Arthur T. White and Lowell W. Beineke. Topological Graph Theory. In Lowell W. Beineke and Robin J. Wilson, editors, Selected Topics in Graph Theory, pages 15-49. Academic Press, New York, 1978.
302. [Wei97] Karsten Weihe. Edge-disjoint (s,t)-paths in undirected planar graphs in linear time. J. Algorithms, 23:121-138, 1997.
303. [Wes83a] Walter Wessel. On some variations of the thickness of a graph connected with colouring. In Miroslav Fiedler, editor, Graphs and Other Combinatorial Topics. Proceedings of the Third Czechoslovak Symposium on Graph Theory, Prague, August 24-27, 1982, pages 344-348. Teubner, Texte zur Mathematik, vol. 59, 1983.
304. [Wes83b] Walter Wessel. Thickness-critical graphs - a generalization of Kuratowski's topic. In M. Borowiecki, J.W. Kennedy, and Maciej M. Sysło, editors, Graph Theory, Proc. of a Conference held in Łagów, Poland, February 10-13, 1981, pages 266-277. Springer-Verlag, Lecture Notes in Mathematics, vol. 1018, 1983.
305. [Wes84] Walter Wessel. Über die Abhängigkeit der Dicke eines Graphen von seinen Knotenpunktvalenzen. In Geometrie und Kombinatorik, 2. Kolloq., Karl-Marx-Stadt, GDR, 1983, part 2, pages 235-238, 1984.
306. 9. In Algebra und Graphentheorie, Beitr. Jahrestag. Algebra Grenzgeb., Siebenlehn, GDR, 1985, pages 123-126, 1986.
307. [Wes89] Walter Wessel. Construction of Critical Graphs by Replacing Edges. In Lars Døling Andersen and Gabriel A. Dirac, editors, Graph theory in memory of G. A. Dirac, pages 473-486. North-Holland, Annals of Discrete Mathematics, vol. 41, 1989.
308. [Wes96] Douglas B. West. Introduction to Graph Theory. Prentice Hall, 1996.
309. [Wes01] Douglas B. West. Introduction to Graph Theory. Prentice Hall, 2nd edition, 2001.
310. [Whi33] Hassler Whitney. Planar graphs. Fundamenta Mathematicae, 21:245-254,1933.
311. [Whi84] Arthur T. White. Graphs, Groups and Surfaces, volume 8 of North-Holland Mathematics Studies. North-Holland, 1984.
312. [Wil80] S.G. Williamson. Embedding graphs in the plane - algorithmic aspects. In J. Srivastava, editor, Combinatorial Mathematics, Optimal Designs and their Applications, pages 349-384. North-Holland, Annals of Discrete Mathematics, vol. 6, 1980.
313. [Wil86] Robin J. Wilson. An Eulerian Trail through Königsberg. J. of Graph Theory, 10:265-275, 1986.
314. [Woo93] D.R.Woodall. Cyclic-Order Graphs and Zarankiewicz's Crossing-Number Conjecture. J. of Graph Theory, 17:657-671, 1993.
315. [Yan78] Mihalis Yannakakis. Node- and Edge-Deletion NP-complete problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78, pages 253-264, 1978.
316. [Yan81] Mihalis Yannakakis. Edge-deletion problems. SIAM J. Comput., 10:297-309, 1981.
317. [Yan86] Mihalis Yannakakis. Four pages are necessary and sufficient for planar graphs. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86, pages 104-108, 1986.
318. [Yan89] Mihalis Yannakakis. Embedding Planar Graphs in Four Pages. J. Computer and System Sciences, 38:36-67, 1989.
319. [Yap81] Hian Poh Yap. A construction of chromatic index critical graphs. J. of Graph Theory, 5:159-163, 1981.
320. [Yap83] Hian Poh Yap. A class of chromatic index critical graphs. Bull. Malays. Math. Soc.,II. Ser., 6:45-46, 1983.
321. [YS99] Atsuko Yamaguchi and Akihiro Sugimoto. An Approximation Algorithms for the Two-Layered Graph Drawing Problem. In Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, and Takeshi Tokuyama, editors, Proceedings 5th Annual International Conference on Computing and Combinatorics, COCOON'99, pages 81-91. Springer-Verlag, Lecture Notes in Computer Science, vol. 1627, 1999.
322. [Zar54] K. Zarankiewicz. On a problem of P. Turán concerning graphs. Fundamenta Mathematicae, 41:137-145, 1954.