| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653674 | European Journal of Combinatorics | 2014 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Steven D. Noble, Gordon F. Royle,