Maximal buttonings of trees

Short, Ian (2014). Maximal buttonings of trees. Discussiones Mathematicae Graph Theory, 34(2) pp. 415–420.

DOI: https://doi.org/10.7151/dmgt.1716

URL: http://www.discuss.wmie.uz.zgora.pl/gt/

Abstract

A buttoning of a tree that has vertices v₁,v₂,...,v_n is a closed walk that starts at v₁ and travels along the shortest path in the tree to v₂, and then along the shortest path to v₃, and so forth, finishing with the shortest path from v_n to v₁. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings in trees.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI