All graphs with maximum degree three whose complements have 4-cycle decompositions

Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is completely characterized.

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith
• Keywords: DM 2008, Maximum Degree, Paper