Hi im kinda confuse with this problem..
"Does every 3-connected cubic graph on 3k vertices admit a partition into k
paths of length two?"
do i need to prove that for every 3-connected cubic graph with 3k vertices, it contains a number of k paths which is a path partition?
thanks and God bless!!