DECOMPOSITIONS OF COMPLETE GRAPHS INTO KAYAK PADDLES
Abstract: A canoe paddle is a
cycle attached to an end-vertex of a path. It was shown by Truszczy´nski that
all canoe paddles are graceful and therefore decomposecomplete graphs. A kayak
paddle is a pair of cycles joined by a path. We prove that the complete graph
K2n+1 is decomposable into kayak paddles with n edges whenever at least one of
its cycles is even.
Author: Dalibor Froncek, Leah
Tollefson
Journal Code: jpmatematikagg110027
