The Tutte Polynomial of a Graph, Depth-first Search
Keyword(s):
One of the most important numerical quantities that can be computed from a graph $G$ is the two-variable Tutte polynomial. Specializations of the Tutte polynomial count various objects associated with $G$, e.g., subgraphs, spanning trees, acyclic orientations, inversions and parking functions. We show that by partitioning certain simplicial complexes related to $G$ into intervals, one can provide combinatorial demonstrations of these results. One of the primary tools for providing such a partition is depth-first search.
2010 ◽
Vol 310
(8)
◽
pp. 1340-1353
◽
2005 ◽
Vol 110
(1)
◽
pp. 31-41
◽
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050017
Keyword(s):