Title
All Graphs With Maximum Degree Three Whose Complements Have 4-Cycle Decompositions
Keywords
3-regular; 4-cycle; Graph decomposition; Specified leave
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 Kn. In this paper G is completely characterized. © 2007 Elsevier B.V. All rights reserved.
Publication Date
7-6-2008
Publication Title
Discrete Mathematics
Volume
308
Issue
13
Number of Pages
2901-2909
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/j.disc.2007.07.082
Copyright Status
Unknown
Socpus ID
41649116486 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/41649116486
STARS Citation
Fu, Chin Mei; Fu, Hung Lin; Rodger, C. A.; and Smith, Todd, "All Graphs With Maximum Degree Three Whose Complements Have 4-Cycle Decompositions" (2008). Scopus Export 2000s. 9896.
https://stars.library.ucf.edu/scopus2000/9896