On path-cycle decompositions of triangle-free graphs

zbMath1401.05161arXiv1402.3741MaRDI QIDQ4560208

Andrea Jiménez, Yoshiko Wakabayashi

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1402.3741

zbMATH Keywords

triangle-freepath decompositioncycle decompositionGallai's conjecturelength constraintodd distance

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items (5)

On computing the path number of a graph ⋮ Towards Gallai's path decomposition conjecture ⋮ Gallai's path decomposition conjecture for graphs of small maximum degree ⋮ Gallai's path decomposition conjecture for triangle-free planar graphs ⋮ Path and cycle decompositions of dense graphs

This page was built for publication: On path-cycle decompositions of triangle-free graphs