Partitioning a graph into cycles with a specified number of chords

Shuya Chiba, Suyun Jiang, Jin Yan

For a graph $G$, let ${\sigma }_2(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive verti…