The crossing numbers of Cartesian products of paths with 5-vertex graphs

Discrete Mathematics

Volumn 233, Issue 1-3, 2001, Pages 353-359

  Klešč, Marián ^a  

^a TECHNICAL UNIVERSITY OF KO ICE   (Slovakia)

Author keywords

Cartesian product; Crossing number; Drawing; Graph; Path

Indexed keywords

EID: 0035962212     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00251-X     Document Type: Article

References (13)

1. L.W. Beineke, R.D. Ringeisen, On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory 4 (1980) 145-155.
2. 4, J. Graph Theory 19 (1995) 125-129.
3. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
4. nn, Čas. Pěst. Math. 107 (1982) 225-230.
5. M. Klešč, On the crossing numbers of Cartesian products of stars and paths or cycles, Math. Slovaca 41 (1991) 113-120.
6. M. Klešč, The crossing numbers of products of paths and stars with 4-vertex graphs, J. Graph Theory 18 (1994) 605-614.
7. M. Klešč, The crossing numbers of certain Cartesian products, Discuss. Math. - Graph Theory 15 (1995) 5-10.
8. n, Tatra Mountains Math. Publ. 9 (1996) 51-56.
9. n, Tatra Mountains Math. Publ. 18 (1999) 63-68.
10. M. Klešč, The crossing numbers of products of 5-vertex graphs with paths and cycles, Discuss. Math. - Graph Theory 19 (1999) 59-69.
11. M. Klešč, On the crossing numbers of products of stars and graphs of order five, Graphs Combin., to appear.
12. n, J. Graph Theory 22 (1996) 239-243.
13. n, J. Combin. Theory 24 (1978) 134-136.