Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Maximal buttonings of trees

Ian Short — 2014

Discussiones Mathematicae Graph Theory

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

Page 1

Download Results (CSV)