On a k-Tree Containing Specified Leaves in a Graph

Author： Matsuda Haruhide   Matsumura Hajime  

Publisher： Springer Publishing Company

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.22, Iss.3, 2006-11, pp. : 371-381

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

An Improved Approximation Algorithm for Multicast k-Tree Routing

By Lin Guohui  

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 349-356

Springer Publishing Company

Access to resources Recommend Favorite

On the Chromatic Number of the Square of the Kneser Graph K(2K+1, K)

By Kim Seog-Jin   Nakprasit Kittikorn  

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 79-90

Springer Publishing Company

Access to resources Recommend Favorite

b-Tree Facets for the Simple Graph Partitioning Polytope

By Sørensen Michael M.  

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning a Graph into Global Powerful k -Alliances

By Yero Ismael  

Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. : 575-583

Springer Publishing Company

Access to resources Recommend Favorite

Existence of 1-Rotational k-Cycle Systems of the Complete Graph

By Buratti Marco  

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 41-46

Springer Publishing Company

Access to resources Recommend Favorite