Publisher
Springer International Publishing
Reference22 articles.
1. J. Adamsson, R.B. Richter, Arrangements and the crossing number of C
m × C
n. J. Combin. Theory B 90, 21–39 (2004)
2. V.B. Alekseev, V.S. Gonchakov, Thickness of arbitrary complete graphs. Mat. Sbornik 101, 212–230 (1976)
3. D. Archdeacon, Open Problems, in Topics in Topological Graph Theory, ed. by L.W. Beineke, R.J. Wilson (Cambridge University Press, Cambridge, 2009), pp. 313–336
4. J. Battle, F. Harary, Y. Kodama, Every planar graph with nine points has a non-planar complement. Bull. Am. Math. Soc. 68, 569–571 (1962)
5. L.W. Beineke, F. Harary, The connectivity function of a graph. Mathematika 14, 197–202 (1967)