Crossing-number critical graphs have bounded path-width

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 2, 2003, Pages 347-367

  Hliněny, Petr ^a,b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b Institute of Mathematics and Computer Science   (Slovakia)

Author keywords

Crossing number; Crossing critical graph; Graph embedding; Path width

Indexed keywords

EID: 0037673584     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00037-6     Document Type: Article

References (17)

1. M. Ajtai, V. Chvátal, M.M. Newborn, E. Szemerédi, Crossing-free subgraphs, Theory and Practice of Combinatorics, North-Holland Mathematics Studies, Vol. 60, North-Holland, Amsterdam, New York, 1982, pp. 9-12.
2. 6, Congr. Numer. 118 (1996) 97-107.
3. 7, Congr. Numer. 125 (1997) 97-117.
4. D. Bienstock, N. Robertson, P. Seymour, R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B 52 (1991) 274-283.
5. S.N. Bhatt, F.T. Leighton, A frame for solving VLSI graph layout problems, J. Comput. Systems Sci. 28 (1984) 300-343.
6. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Englewood Cliffs, NJ, 1999.
7. G. Ding, B. Oporowski, R. Thomas, D. Vertigan, Large four-connected nonplanar graphs, unpublished.
8. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983) 312-316.
9. J. Geelen, B. Richter, G. Salazar, Embedding grids on surfaces, manuscript, 2000.
10. P. Hliněný, Crossing-Critical Graphs and Path-width, in: Graph Drawing, 9th Symposium GD 2001, Vienna, Austria, September 2001; Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2002, pp. 102-114.
11. M. Kochol, Construction of crossing-critical graphs, Discrete Math. 66 (1987) 311-313.
12. J. Pach, G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997) 427-439.
13. J. Pach, G. Tóth, Which crossing number is it, anyway?, Proceedings of the 39th Foundations of Computer Science (1998), IEEE Press, New York, 1999, pp. 617-626.
14. 5, Discrete Comput. Geom. 13 (1995) 149-159.
15. B. Richter, C. Thomassen, Minimal graphs with crossing number at least k, J. Combin. Theory Ser. B 58 (1993) 217-224.
16. N. Robertson, P. Seymour, Graph minors I. Excluding a forest, J. Combin. Theory Ser. B 35 (1983) 39-61.
17. W.T. Tutte, Toward a theory of crossing numbers, J. Combin. Theory 8 (1970) 45-53.