On path-cycle decompositions of triangle-free graphs
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the characterization of the class of all triangle-free graphs with odd distanc...
-д хадгалсан:
| Үндсэн зохиолчид: | , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Discrete Mathematics & Theoretical Computer Science
2017-10-01
|
| Цуврал: | Discrete Mathematics & Theoretical Computer Science |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://dmtcs.episciences.org/659/pdf |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|