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...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
University of Zielona Góra
2014-05-01
|
| シリーズ: | Discussiones Mathematicae Graph Theory |
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.7151/dmgt.1716 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|