The absence of efficient dual pairs of spanning trees in planar graphs.
The Electronic Journal of Combinatorics [electronic only] (2006)
- Volume: 13, Issue: 1, page Research paper N13, 7 p.-Research paper N13, 7 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topRiley, T.R., and Thurston, W.P.. "The absence of efficient dual pairs of spanning trees in planar graphs.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper N13, 7 p.-Research paper N13, 7 p.. <http://eudml.org/doc/126454>.
@article{Riley2006,
author = {Riley, T.R., Thurston, W.P.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {diameters},
language = {eng},
number = {1},
pages = {Research paper N13, 7 p.-Research paper N13, 7 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The absence of efficient dual pairs of spanning trees in planar graphs.},
url = {http://eudml.org/doc/126454},
volume = {13},
year = {2006},
}
TY - JOUR
AU - Riley, T.R.
AU - Thurston, W.P.
TI - The absence of efficient dual pairs of spanning trees in planar graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper N13, 7 p.
EP - Research paper N13, 7 p.
LA - eng
KW - diameters
UR - http://eudml.org/doc/126454
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.