Partitioning a graph into cycles with a specified number of chords
Partitioning a graph into cycles with a specified number of chords
Abstract For a graph , let be the minimum degree sum of two nonadjacent vertices in . A chord of a cycle in a graph is an edge of joining two nonconsecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a …