All graphs with maximum degree three whose complements have 4-cycle decompositions
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
2909 | en_US |
dc.citation.issue |
13 | en_US |
dc.citation.spage |
2901 | en_US |
dc.citation.volume |
308 | en_US |
dc.citation.woscount |
0 | |
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.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | 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.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.identifier.doi |
10.1016/j.disc.2007.07.082 | en_US |
dc.identifier.issn |
0012-365X | en_US |
dc.identifier.journal |
DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.disc.2007.07.082 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8584 | |
dc.identifier.wosnumber |
WOS:000256107600028 | |
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 |
檔案
- 000256107600028.pdf (243.9 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Fu, C.-M., Fu, H.-L., Rodger, C. A., & Smith, T. (2008). All graphs with maximum degree three whose complements have 4-cycle decompositions. DISCRETE MATHEMATICS, 308(13), 2901–2909. https://doi.org/10.1016/j.disc.2007.07.082
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8584