论文信息 - Graph minors and the crossing number of graphs

Graph minors and the crossing number of graphs

Abstract There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leighton's work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.

László A. Székely | Éva Czabarka | Imrich Vrto | Drago Bokal

[1] F. Shahrokhi,et al. The Crossing Number of a Graph on a Compact 2-Manifold , 1996 .

[2] Gelasio Salazar,et al. Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree , 2001, J. Graph Theory.

[3] Anton Kotzig,et al. Theory and practice of combinatorics : a collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday , 1982 .

[4] P. Erdös,et al. Crossing Number Problems , 1973 .

[5] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[6] P. Erdös,et al. Crossing Number Problems , 1973 .

[7] Bojan Mohar,et al. The Minor Crossing Number , 2006, SIAM J. Discret. Math..

[8] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .

[9] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[10] Martin Aigner,et al. Proofs from THE BOOK , 1998 .

[11] János Pach,et al. Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs , 2006, Discret. Comput. Geom..

[12] Gelasio Salazar,et al. Bounding the Crossing Number of a Graph in terms of the Crossing Number of a Minor with Small Max , 2001, Journal of Graph Theory.

[13] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .

[14] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .