论文信息 - Crossing number is hard for cubic graphs

Crossing number is hard for cubic graphs

It was proved by [M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983) 312-316] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very high degrees. We prove here that it is NP-hard to determine the crossing number of a simple 3-connected cubic graph. In particular, this implies that the minor-monotone version of the crossing number problem is also NP-hard, which has been open till now.

Petr Hlinený

[1] R. Richter,et al. The crossing number of C 5 × C n , 1996 .

[2] R. Bruce Richter,et al. The crossing number of C5 × Cn , 1996, J. Graph Theory.

[3] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .

[4] Jj Anos Pach. Which Crossing Number Is It Anyway? , 1998 .

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

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

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Martin Grohe,et al. Computing crossing numbers in quadratic time , 2000, STOC '01.

[9] Michael J. Pelsmajer,et al. Odd Crossing Number Is Not Crossing Number , 2005, GD.