Please use this identifier to cite or link to this item:
|Title:||The Merino–Welsh conjecture holds for series–parallel graphs|
|Keywords:||Merino–Welsh conjecture;cyclic orientations;acyclic orientations|
|Citation:||European Journal of Combinatorics, 38: 24 - 35, (May 2014)|
|Abstract:||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.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.