Crossing-critical graphs and path-width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2265 LNCS, Issue , 2002, Pages 102-114

  Hliněný, Petr ^a,b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPHIC METHODS;

CRITICAL GRAPH; CROSSING NUMBER; CUT SETS; EDGE CROSSING; GRAPH G; LOWER BOUNDS; NEW CONSTRUCTIONS; PATHWIDTH;

GRAPH THEORY;

EID: 84867473536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_9     Document Type: Conference Paper

References (22)

1. M. Ajtai, V. Chvátal, M.M. Newborn, E. Szemerédi, Crossing-free subgraphs., Theory and practice of combinatorics, 9-12, North-Holland Math. Stud. 60, North-Holland, Amsterdam-New York, 1982.
2. D. Bienstock, N. Robertson, P. Seymour, R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B 52 (1991), 274-283.
3. S.N. Bhatt, F.T. Leighton, A frame for solving VLSI graph layout problems, J. of Computer and Systems Science 28 (1984), 300-343.
4. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall 1999 (ISBN 0-13-301615-3).
5. G. Ding, B. Oporowski, R. Thomas, D. Vertigan, Large four-connected nonplanar graphs, in preparation.
6. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983), 312-316.
7. J. Geelen, B. Richter, G. Salazar, Embedding grids on surfaces, manuscript.
8. n) = (m - 2)n is true for all but finitely n, for each m, submitted.
9. P. Hliněný, Crossing-number critical graphs have bounded path-width, submitted. http://www.mcs.vuw.ac.nz/~hlineny/doc/crpath2.ps.gz
10. M. Kochol, Construction of crossing-critical graphs, Discrete Math. 66 (1987), 311-313.
11. F.T. Leighton, Complexity Issues in VLSI, M.I.T. Press, Cambridge, 1983.
12. P. Mutzel, T. Ziegler, The Constrained Crossing Minimization Problem, In: Proceedings Graph Drawing '99, Štiřín Castle, Czech Republic, September 1999 (J. Kratochvíl ed.), 175-185;
13. Lecture Notes in Computer Science 1731, Springer Verlag, Berlin 2000 (ISBN 3-540-66904-3).
14. J. Pach, G. Tóth, Which crossing number is it, anyway?, Proc. 39th Foundations of Computer Science (1998), IEEE Press 1999, 617-626.
15. H. Purchase, Which Aesthetics has the Greates Effect on Human Understanding, In: Proceedings Graph Drawing '97, Rome, Italy, September 18-201997 (G. DiBattista ed.), 248-261;
16. Lecture Notes in Computer Science 1353, Springer Verlag, Berlin 1998 (ISBN 3-540-63938-1).
17. 5, Discrete Comput. Geom. 13 (1995), 149-159.
18. n, Australas. J. Combin. 23 (2001), 135-143.
19. N. Robertson, P. Seymour, Graph minors I. Excluding a forest, J. Combin. Theory Ser. B 35 (1983), 39-61.
20. F. Shahrokhi, I. Vrt'o, On 3-Layer Crossings and Pseudo Arrangements, In: Proceedings Graph Drawing '99, Štiřín Castle, Czech Republic, September 1999 (J. Kratochvíl ed.), 225-231;
21. Lecture Notes in Computer Science 1731, Springer Verlag, Berlin 2000 (ISBN 3-540-66904-3).
22. W.T. Tutte, Toward a theory of crossing numbers, J. Combinatorial Theory 8 (1970), 45-53.