The Merino-Welsh conjecture holds for series-parallel graphs

作者：Noble Steven D^*; Royle Gordon F

来源：European Journal of Combinatorics, 2014, 38: 24-35.

DOI：10.1016/j.ejc.2013.11.002

The Merino-Welsh conjecture asserts that the number of spanning trees of a graph is no greater than the maximum of the numbers of totally cyclic orientations and acyclic orientations of that graph. We prove this conjecture for the class of series-parallel graphs.

• 出版日期2014-5