Article ID Journal Published Year Pages File Type
4650664 Discrete Mathematics 2008 9 Pages PDF
Abstract

Let GG 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 KnKn. In this paper GG is completely characterized.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
All graphs with maximum degree three whose complements have 4-cycle decompositions
Authors
, , , ,