On isomorphic linear partitions in cubic graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

On isomorphic linear partitions in cubic graphs


A linear forest is a graph that 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. It is well known that la(G)=2 when G is a cubic graph and Wormald conjectured that if |V(G)= 0 (mod 4), then it is always possible to find a linear partition in two isomorphic linear forests. We give here some new results concerning this conjecture.
No file

Dates and versions

hal-00325282 , version 1 (27-09-2008)


  • HAL Id : hal-00325282 , version 1


Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda. On isomorphic linear partitions in cubic graphs. 5th Krakow Conference on Graph Theory USTRON'06, Sep 2006, Ustron, Poland. pp.277-284. ⟨hal-00325282⟩
49 View
0 Download


Gmail Facebook X LinkedIn More