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

檔案

日期

2008-07-06

類型

期刊名稱

DISCRETE MATHEMATICS

卷期與頁次

第 308 卷第 13 期,頁 2901–2909

ISSN

0012-365X

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8584