On odd and semi-odd linear partitions of cubic graphs
A linear forest is a graph whose connected components are chordless paths. A linear partition of a graph G is a partition of its edge set into linear forests and la(G) is the minimum number of linear forests in a linear partition. In this paper we consider linear partitions of cubic simple graphs for which it is well known that la(G) = 2. A linear partition is said to be odd whenever each path of has odd length and semi-odd whenever each path of (or each path of ) has odd length. In [2] Aldred...