On path-cycle decompositions of triangle-free graphs
Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 3
Voir la notice de l'article provenant de la source Episciences
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 distance at least $3$ that admit a path-cycle decomposition with elements of length at least $4$. As a consequence, it follows that Gallai's conjecture on path decomposition holds in a broad class of sparse graphs.
@article{DMTCS_2017_19_3_a8,
author = {Jim\'enez, Andrea and Wakabayashi, Yoshiko},
title = {On path-cycle decompositions of triangle-free graphs},
journal = {Discrete mathematics & theoretical computer science},
publisher = {mathdoc},
volume = {19},
number = {3},
year = {2017-2018},
doi = {10.23638/DMTCS-19-3-7},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-3-7/}
}
TY - JOUR AU - Jiménez, Andrea AU - Wakabayashi, Yoshiko TI - On path-cycle decompositions of triangle-free graphs JO - Discrete mathematics & theoretical computer science PY - 2017-2018 VL - 19 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-3-7/ DO - 10.23638/DMTCS-19-3-7 LA - en ID - DMTCS_2017_19_3_a8 ER -
%0 Journal Article %A Jiménez, Andrea %A Wakabayashi, Yoshiko %T On path-cycle decompositions of triangle-free graphs %J Discrete mathematics & theoretical computer science %D 2017-2018 %V 19 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-3-7/ %R 10.23638/DMTCS-19-3-7 %G en %F DMTCS_2017_19_3_a8
Jiménez, Andrea; Wakabayashi, Yoshiko. On path-cycle decompositions of triangle-free graphs. Discrete mathematics & theoretical computer science, Tome 19 (2017-2018) no. 3. doi: 10.23638/DMTCS-19-3-7
Cité par Sources :