Spanning Trees with Vertices Having Large Degrees

E-ISSN： 1097-0118|79|3|213-221

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.79, Iss.3, 2015-07, pp. : 213-221

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices

By Silva Ricardo Silva Diego Resende Mauricio Mateus Geraldo Gonçalves José Festa Paola

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1225-1243

Springer Publishing Company

Access to resources Recommend Favorite

A Spanning Tree with High Degree Vertices

By Ozeki Kenta Yamashita Tomoki

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 591-596

Springer Publishing Company

Access to resources Recommend Favorite

Degree Bounded Spanning Trees

By Fujisawa Jun

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 695-720

Springer Publishing Company

Access to resources Recommend Favorite

Signpost systems and spanning trees of graphs

By Nebeský Ladislav

Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. : 885-893

Springer Publishing Company

Access to resources Recommend Favorite

Increasing the Weight of Minimum Spanning Trees

By Frederickson G.N. Solis-Oba R.

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 244-266

Academic Press

Access to resources Recommend Favorite