Euclidean Bounded-Degree Spanning Tree Ratios

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.32, Iss.2, 2004-07, pp. : 177-194

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

Related content

Automatic structures of bounded degree revisited

The Journal of Symbolic Logic, Vol. 76, Iss. 4, 2011-12 ,pp. : 1352-1380

Cambridge University Press

Access to resources Recommend Favorite

Factorizations of some weighted spanning tree enumerators

By Martin J.L. Reiner V.

Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 2, 2003-11 ,pp. : 287-300

Elsevier

Access to resources Recommend Favorite

Facility location and the geometric minimum-diameter spanning tree

By Gudmundsson J. Haverkort H. Park S.-M. Shin C.-S. Wolff A.

Computational Geometry, Vol. 27, Iss. 1, 2004-01 ,pp. : 87-106

Elsevier

Access to resources Recommend Favorite

Trimmed Moebius Inversion and Graphs of Bounded Degree

By Björklund Andreas

Theory of Computing Systems, Vol. 47, Iss. 3, 2010-10 ,pp. : 637-654

Springer Publishing Company

Access to resources Recommend Favorite

ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS

Bulletin of the Australian Mathematical Society, Vol. 91, Iss. 3, 2015-06 ,pp. : 353-367

Cambridge University Press

Access to resources Recommend Favorite