English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3907993      Online Users : 610
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/50383


    Title: All graphs with maximum degree three whose complements have 4-cycle decompositions
    Authors: 高金美;Fu, Chin-mei;Fu, Hung-lin;Rodger, C. A;Smith, Todd
    Contributors: 淡江大學數學學系
    Keywords: 4-cycle;Specified leave;3-regular;Graph decomposition
    Date: 2008-07
    Issue Date: 2010-08-09 16:40:16 (UTC+8)
    Publisher: Amsterdam: Elsevier BV * North-Holland
    Abstract: Let GG 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 KnKn. In this paper GG is completely characterized.
    Relation: Discrete Mathematics 308(13), pp.2901-2909
    DOI: 10.1016/j.disc.2007.07.082
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0012-365X_308(13)p2901-2909.pdf243KbAdobe PDF434View/Open
    All graphs with maximum degree three whose complements have 4-cycle decompositions.pdf243KbAdobe PDF2View/Open
    index.html0KbHTML156View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback