Mordecai J. Golin, Yiu-Cho Leung. Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. In Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel, editors, Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers. Volume 3353 of Lecture Notes in Computer Science, pages 296-307, Springer, 2004. [doi]
Abstract is missing.