Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

E-ISSN： 1097-0118|87|4|561-580

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.87, Iss.4, 2018-04, pp. : 561-580

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

Long cycles in random subgraphs of graphs with large minimum degree

RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. : 764-767

John Wiley & Sons Inc

Access to resources Recommend Favorite

Computing maximum upward planar subgraphs of single-source embedded digraphs

By Rextin Aimal

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 368-392

Springer Publishing Company

Access to resources Recommend Favorite

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

By Kamei Sayaka

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 430-459

Springer Publishing Company

Access to resources Recommend Favorite

On the Maximum Arc Length of Monotonic Functions

By Deĺeglise Marc Markoe Andrew

American Mathematical Monthly, Vol. 121, Iss. 8, 2014-10 ,pp. : 689-699

Mathematical Association of America

Access to resources Recommend Favorite

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

By Dinitz Y. Nutov Z.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 31-40

Academic Press

Access to resources Recommend Favorite