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

Abstract

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 K(n). In this paper g is completely characterized. (C) 2007 Elsevier B.V. All rights reserved.