@inproceedings{5e2e1a2010644a588717c75a11611c53,
title = "On the spanning trees of weighted graphs",
abstract = "Given a weighted graph, let W1, W2, W3,.. denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weight W1 is at most k — 1 edge swaps away from some spanning tree of weight Wk. Three other conjectures posed by Kano are proven for two special classes of graphs. Finally, we consider the algorithmic complexity of generating a spanning tree of weight Wk.",
author = "Mayr, {Ernst W.} and Plaxton, {C. Greg}",
note = "Publisher Copyright: {\textcopyright} 1989, Springer-Verlag.; 14th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1988 ; Conference date: 15-06-1988 Through 17-06-1988",
year = "1989",
doi = "10.1007/3-540-50728-0_58",
language = "English",
isbn = "9783540507284",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "394--405",
editor = "{van Leeuwen}, J.",
booktitle = "Graph-Theoretic Concepts in Computer Science - International Workshop, WG 1988, Proceedings",
}