References
- Biggs , N.L. 1989 . Discrete Mathematics , Oxford : Clarendon Press .
- Feigenbaum , J. , Hershberger , J. and Schäffer , A.A. 1985 . A Polynomial Time Algorithm for Finding the Prime Factors of Cartesian-Product Graphs . Discrete Applied Mathematics , 12 : 123 – 138 .
- Hagauer , J. , Imrich , W. and Klavžar , S. 1999 . Recognizing median graphs in sub-quadratic time . Theoretical Computer Science , 215 : 123 – 136 .
- Imrich , W. , Pisanski , T. and Žerovnik , J. 1997 . Recognizing Cartesian Graph Bundles . Discrete Mathematics , 167/168 : 393 – 403 .
- Imrich , W. and Žerovnik , J. 1994 . Factoring Cartesian-product Graphs . Journal of Graph Theory , 18 : 557 – 567 .
- Pisanski , T. , Shawe-Taylor , J. and Vrabec , J. 1983 . Edge-colorability of graph bundles . Journal of Combinatorial Theory , 35 : 12 – 19 . Series B
- Sabidussi , G. 1960 . Graph Multiplication . Mathematische Zeitschrift , 72 : 446 – 457 .
- Vega Version 0.2 Quick Reference Manual and Vega Graph Gallery Pisanski T. IMFM Ljubljana 1995 www.mat.uni-lj.si/dwnld.htm