GOLIN, M. J., & YIU CHO LEUNG. (2004, January 1). Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters. Presented at the. Berlin: Springer, 2004. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=16546100
ISO-690 (author-date, English)GOLIN, Mordecai J and YIU CHO LEUNG, 2004. Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters. In: [online]. Berlin: Springer, 2004. 1 January 2004. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=16546100
Modern Language Association 9th editionGOLIN, M. J., and YIU CHO LEUNG. Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters. Berlin: Springer, 2004., 2004, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=16546100.
Mohr Siebeck - Recht (Deutsch - Österreich)Emerald - Harvard
GOLIN, M.J. and YIU CHO LEUNG. (2004), “Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters”, in , Vol. , Berlin: Springer, 2004., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=16546100.