REFERENCES 83
[Hli06] P. Hlinˇen´y. Crossing number is hard for cubic graphs. Journal of Combi-
natorial Theory, Series B, 96:455–471, 2006.
[HS06] P. Hlinˇen ´y and G. Salazar. On the crossing number of almost planar
graphs. In Proc. GD ’05, volume 4372 of LNCS, pages 162–173. Spr in ger ,
2006.
[HS07] P. Hlinˇen´y and G. Salazar. Approximating the crossing number of toroidal
graphs. In Proc. ISAAC ’07, volume 4835 of LNCS, pages 148–159.
Springer, 2007.
[HT73] J. Hopcroft and R. E. Tarjan. Dividing a graph into tr i conn ec te d compo-
nents. SIAM J. Comput ., 2(3):135–158, 1973.
[HT74] J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM,
21(4):549–568, 1974.
[JLM98] M. J¨unger, S. Le ipert, and P. Mutzel. A note on computing a maximal
planar ...