查詢結果分析
來源資料
相關文獻
- Packing 4-cycles into Complete Multigraphs
- Packing and Covering Multicrowns with 4-cycles
- Packing and Covering Complete Bipartite Multidigraphs with 4-Circuits
- Packing Complete Tripartite Multidigraphs with 4-circuits
- Minimum Leaves of Complete Multidigraphs by Packing Directed 4-cycles
- Packing and Covering Complete Graphs with 3- and 4-paths
- (Pκ,Sκ)-Multidecomposition of C□,□
- Decomposing Crowns into 4- and 8-cycles (Circuits)
- Decompositions of Circulant Graphs into Short Cycles (Circuits)
- The Effects of Starch and Protein Degradation Rates, Hay Sources, and Feeding Frequency on Rumen Microbial Fermentation in a Continuous Culture System
頁籤選單縮合
題 名 | Packing 4-cycles into Complete Multigraphs=多重邊完全圖之4-迴圈充填 |
---|---|
作 者 | 林正忠; 周敏貞; 林雅萍; | 書刊名 | 嶺東學報 |
卷 期 | 24 2008.12[民97.12] |
頁 次 | 頁75-86 |
分類號 | 319.9 |
關鍵詞 | 迴圈; 多重邊完全圖; 充填; 餘圖; 分解; Cycle; Complete multigraph; Packing; Leave; Decomposition; |
語 文 | 英文(English) |
中文摘要 | 在本篇文章中,我們找到了多重邊完全圖中最大的4-迴圈充填及其相對最小的餘圖。 |
英文摘要 | In this paper we give the solution of finding maximum packings of complete multigraphs with edge-disjoint 4-cycles and the minimum leaves are given. |
本系統中英文摘要資訊取自各篇刊載內容。