Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/9384
Title: | The Merino–Welsh conjecture holds for series–parallel graphs |
Authors: | Noble, SD Royle, GF |
Keywords: | Merino–Welsh conjecture;cyclic orientations;acyclic orientations |
Issue Date: | 2014 |
Publisher: | Elsevier |
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. |
URI: | http://www.sciencedirect.com/science/article/pii/S0195669813002473 http://bura.brunel.ac.uk/handle/2438/9384 |
DOI: | http://dx.doi.org/10.1016/j.ejc.2013.11.002 |
ISSN: | 0195-6698 |
Appears in Collections: | Dept of Mathematics Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 283.16 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.