Maximal buttonings of trees
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 ine...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Zielona Góra
2014-05-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online pristup: | https://doi.org/10.7151/dmgt.1716 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|