Kevin Buchin, André Schulz. On the Number of Spanning Trees a Planar Graph Can Have. In Mark de Berg, Ulrich Meyer, editors, Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I. Volume 6346 of Lecture Notes in Computer Science, pages 110-121, Springer, 2010. [doi]
@inproceedings{BuchinS10,
title = {On the Number of Spanning Trees a Planar Graph Can Have},
author = {Kevin Buchin and André Schulz},
year = {2010},
doi = {10.1007/978-3-642-15775-2_10},
url = {http://dx.doi.org/10.1007/978-3-642-15775-2_10},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BuchinS10},
cites = {0},
citedby = {0},
pages = {110-121},
booktitle = {Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I},
editor = {Mark de Berg and Ulrich Meyer},
volume = {6346},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-15774-5},
}