Editing Kirchhoff's theorem (section)

== References ==
{{reflist}}
{{refbegin}}
*{{citation
 | last1 = Harris | first1 = John M.
 | last2 = Hirst | first2 = Jeffry L.
 | last3 = Mossinghoff | first3 = Michael J.
 | edition = 2nd
 | publisher = Springer
 | series = [[Undergraduate Texts in Mathematics]]
 | title = Combinatorics and Graph Theory
 | year = 2008}}.
*{{citation
 | last = Maurer | first = Stephen B.
 | issue = 1
 | journal = SIAM Journal on Applied Mathematics
 | mr = 0392635
 | pages = 143–148
 | title = Matrix generalizations of some theorems on trees, cycles and cocycles in graphs
 | volume = 30
 | year = 1976
 | doi=10.1137/0130017}}.
*{{citation
 | last = Tutte | first = W. T.
 | isbn = 978-0-521-79489-3
 | page = 138
 | publisher = Cambridge University Press
 | title = Graph Theory
 | year = 2001}}.
*{{citation
 | title = Matrix Tree Theorems
 | journal = Journal of Combinatorial Theory, Series A
 | volume = 24
 | number = 3
 | pages = 377–381
 | year = 1978
 | issn = 0097-3165
 |author1=Chaiken, S.  |author2=Kleitman, D.
 | doi=10.1016/0097-3165(78)90067-5| doi-access = free
 }}
{{refend}}

[[Category:Algebraic graph theory]]
[[Category:Spanning tree]]
[[Category:Theorems in graph theory]]
[[Category:Gustav Kirchhoff]]