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...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2017-10-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/659/pdf |