|Title:||Maximal Spanning Trees For Certain Plannar Graphs
|Abstract:||It is shown that a plannar connected map with no 'islands' or 'island groups', with n-finite countries and such that every finite country has at least 3 bordering edges, can be spanned by a tree with number of leaves less or equal than lower-bound(sqrt(n/2)) This bound is shown to be sharp.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1975/CS/CS0068), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1975
To the main CS technical reports page
Computer science department, Technion