淡江大學機構典藏:Item 987654321/108414
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62797/95867 (66%)
造访人次 : 3734929      在线人数 : 387
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/108414


    题名: Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths
    作者: Fu, Chin-Mei;Huang, Kuo-Ching;Mishima, Miwako
    关键词: Complete bipartite graph;Cycle decomposition
    日期: 2016-07-01
    上传时间: 2016-11-25 02:10:40 (UTC+8)
    出版者: Springer Japan KK
    摘要: Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, Kn,n or Kn,n−I , where I is a 1-factor of Kn,n , can be decomposed into cycles of distinct even lengths for any integer n≥2 with the exception of n=4 .
    關聯: Graphs and Combinatorics 32(4), pp.1397–1413
    DOI: 10.1007/s00373-015-1664-9
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths.pdf469KbAdobe PDF3检视/开启
    index.html0KbHTML193检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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