Semirotational Tree Factorizations of Complete Graphs
We select the class of so-called semisymmetric trees and prove that every tree T from this class admits a T-factorization of a special form in the case where T is of order n = 2k ≤ 16. We formulate the conjecture that every semisymmetric tree T admits a T-factorization. We establish the existence of...
Saved in:
| Date: | 2001 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian English |
| Published: |
Institute of Mathematics, NAS of Ukraine
2001
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/4295 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |