Title

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

Authors

Authors

C. M. Fu; H. L. Fu; C. A. Rodger;T. Smith

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Discret. Math.

Keywords

4-cycle; specified leave; 3-regular; graph decomposition; EXCLUDING CONTIGUOUS UNITS; PARTIAL 6-CYCLE SYSTEMS; CYCLE; DECOMPOSITIONS; 2-REGULAR LEAVES; DESIGNS; Mathematics

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.

Journal Title

Discrete Mathematics

Volume

308

Issue/Number

13

Publication Date

1-1-2008

Document Type

Article

Language

English

First Page

2901

Last Page

2909

WOS Identifier

WOS:000256107600028

ISSN

0012-365X

Share

COinS