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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, Chin-Mei	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Rodger, C. A.	en_US
dc.contributor.author	Smith, Todd	en_US
dc.date.accessioned	2014-12-08T15:11:12Z	-
dc.date.available	2014-12-08T15:11:12Z	-
dc.date.issued	2008-07-06	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.disc.2007.07.082	en_US
dc.identifier.uri	http://hdl.handle.net/11536/8584	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	4-cycle	en_US
dc.subject	specified leave	en_US
dc.subject	3-regular	en_US
dc.subject	graph decomposition	en_US
dc.title	All graphs with maximum degree three whose complements have 4-cycle decompositions	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.disc.2007.07.082	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	308	en_US
dc.citation.issue	13	en_US
dc.citation.spage	2901	en_US
dc.citation.epage	2909	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000256107600028	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.