On the crossing numbers of Cartesian products with paths

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 3, 2007, Pages 381-384

  Bokal, Drago ^a  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

Cartesian product; Crossing number; Path

Indexed keywords

EID: 33847659265     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.06.003     Document Type: Article

References (10)

1. Beineke L.W., and Ringeisen R.D. On the crossing numbers of products of cycles and graphs of order four. J. Graph Theory 4 (1980) 145-155
2. D. Bokal, Structural approach to the crossing number of graphs, Dissertation, University of Ljubljana, 2006
3. n is as conjectured for n ≥ m (m + 1). J. Graph Theory 47 (2004) 53-72
4. n. Čas. Pest. Mat. 107 (1982) 225-230
5. 5, n. J. Combin. Theory Ser. B 9 (1971) 315-323
6. Klešč M. On the crossing numbers of the Cartesian product of stars and paths or cycles. Math. Slovaca 41 (1991) 113-120
7. 3. Discrete Math. 251 (2002) 109-117
8. n. J. Combin. Theory Ser. B 24 (1978) 134-136
9. Salazar G. Infinite families of crossing-critical graphs with given average degree. Discrete Math. 271 (2003) 343-350
10. White A.T., and Beineke L.W. Topological Graph Theory. In: Beineke L.W., and Wilson R.J. (Eds). Selected Topics in Graph Theory (1978), Academic Press, New York 15-50