All graphs with maximum degree three whose complements have 4-cycle decompositions
Abbreviated Journal Title
4-cycle; specified leave; 3-regular; graph decomposition; EXCLUDING CONTIGUOUS UNITS; PARTIAL 6-CYCLE SYSTEMS; CYCLE; DECOMPOSITIONS; 2-REGULAR LEAVES; DESIGNS; Mathematics
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.
"All graphs with maximum degree three whose complements have 4-cycle decompositions" (2008). Faculty Bibliography 2000s. 335.