The Minor Crossing Number

The minor crossing number of a graph G is defined as the minimum crossing number of all graphs that contain G as a minor. Basic properties of this new invariant are presented. We study topological structure of graphs with bounded minor crossing number and obtain a new strong version of a lower bound based on the genus. We also give a generalization of an inequality of Moreno and Salazar crossing numbers of a graph and its minors.

[1]  Tom Madej,et al.  Bounds for the crossing number of the N-cube , 1991, J. Graph Theory.

[2]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[3]  Henry H. Glover,et al.  103 Graphs that are irreducible for the projective plane , 1979, J. Comb. Theory, Ser. B.

[4]  Ondrej Sýkora,et al.  On crossing numbers of hypercubes and cube connected cycles , 1993, BIT.

[5]  R. Bruce Richter,et al.  Cubic graphs with crossing number two , 1988, J. Graph Theory.

[6]  Gelasio Salazar,et al.  The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1) , 2004, J. Graph Theory.

[7]  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.

[8]  G. Salazar,et al.  The crossing number of C m × C n is as conjectured for n ≥ m(m + 1) , 2004 .

[9]  Paul D. Seymour,et al.  Excluding a graph with one crossing , 1991, Graph Structure Theory.

[10]  Bojan Mohar,et al.  An algorithm for embedding graphs in the torus ∗ , 2001 .

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

[12]  Petr Hliněný.  Crossing Number is Hard for Cubic Graphs (extended abstract) , 2004 .

[13]  R. Bruce Richter,et al.  On 3-regular graphs having crossing number at least 2 , 1994, J. Graph Theory.

[14]  W. Sierpinski,et al.  Sur le probléme des courbes gauches en Topologie , 2022 .

[15]  Dan Archdeacon,et al.  Problems in Topological Graph Theory , 1995 .

[16]  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.

[17]  Bojan Mohar,et al.  Projective Planarity in Linear Time , 1993, J. Algorithms.

[18]  Frank Thomson Leighton,et al.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[19]  Dan Archdeacon,et al.  A Kuratowski theorem for the projective plane , 1981, J. Graph Theory.

[20]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..