Graph minors and the crossing number of graphs

Electronic Notes in Discrete Mathematics

Volumn 28, Issue , 2007, Pages 169-175

  Bokal, Drago ^a   Czabarka, Éva ^b   Székely, László A ^b   Vrt'o, Imrich ^c  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

crossing number; graph minor; minor crossing number

Indexed keywords

EID: 33847300553     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.01.024     Document Type: Article

References (10)

1. Aigner M., and Ziegler G.M. Proofs from The Book (2000), Springer, Berlin
2. Ajtai M., Chvátal V., Newborn M.M., and Szeméredi E. Crossing-free subgraphs. In: Rosa A., Sabidussi G., and Turgeon J. (Eds). Theory and Practice of Combinatorics: a Collection of Articles Honoring Anton Kotzig on the Occasion of His Sixtieth Birthday. Ann. Discrete Math. 12 (1983), North Holland, Amsterdam 9-12
3. Bokal D., Fijavž G., and Mohar B. The minor crossing number. SIA J. Discrete Math. 20 (2006) 344-356
4. Erdo{combining double acute accent}s P., and Guy R.K. Crossing number problems. Amer. Math. Monthly 80 (1973) 52-58
5. Leighton F.T. Complexity Issues in VLSI (1983), MIT Press, Cambridge
6. Lipton R.J., and Tarjan R.E. A separator theorem for planar graphs. SIA J. Appl. Math. 36 (1979) 177-189
7. Moreno E.G., and Salazar G. Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree. J. Graph Theory 36 (2001) 168-173
8. Pach J., Radoičić R., Tardos G., and Tóth G. Improving the crossing lemma by finding more crossings in sparse graphs. In: Snoeyink J., and Boissonnat J.D. (Eds). Proceedings of the Twentieth Annual Symposium on Computational Geometry (2004), ACM Press, New York 68-75
9. Shahrokhi F., Sýkora O., Székely L.A., and Vrt'o I. The crossing number of a graph on a compact 2-manifold. Adv. Math. 123 (1996) 105-119
10. Székely L.A. Crossing numbers and hard Erdo{combining double acute accent}s problems in discrete geometry. Combin. Probab. Comput. 6 (1997) 353-358