English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7365078      線上人數 : 93
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41296

    題名: Decomposition of Km,n into 4-cycles and 2t-cycles
    作者: Chou, Chao-chih;高金美;Fu, Chin-mei
    貢獻者: 淡江大學數學學系
    關鍵詞: Complete bipartite graph;Cycle decomposition
    日期: 2007-10
    上傳時間: 2010-01-28 07:13:31 (UTC+8)
    出版者: Springer
    摘要: In this paper we show the sufficient conditions for the decomposition of the complete bipartite graphs K2m,2n and K2n+1,2n+1−F into cycles of two different lengths 4 and 2t, t>2, where F is a 1-factor of K2n+1,2n+1. After that we prove that the results are true for t=5 and 6.
    關聯: Journal of Combinatorial Optimization 14(2), pp.205-218
    DOI: 10.1007/s10878-007-9060-x
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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