- 期刊
- OpenAccess
Packing Complete Tripartite Multidigraphs with 4-circuits
完全三部重邊有向圖之4迴圈充塡之研究
並列摘要
A k-circuit C(subscript k) is a directed cycle of length k. For a multidigraph G, a C(subscript k)-packing is a set of arc-disjoint subdigraphs of G each of which is isomorphic to C(subscript k) A C (subscript k)-packing is maximum if it has the maximum number of members among all packings. In this paper the problem for finding a maximum C(subscript k) -packing of complete tripartite multidigraph is solved.
延伸閱讀
- Lin, J. J., Jou, M. J., & Lin, Y. P. (2009). 多摺完全對稱有向圖之4-有向迴圈覆蓋. 嶺東學報, (25), 157-164. https://doi.org/10.29850/LTJ.200906.0009
- Hsu, Y. F. (2013). 4-迴圈裝填圖的探討 [doctoral dissertation, Tamkang University]. Airiti Library. https://doi.org/10.6846/TKU.2013.00613
- Lai, C. S. (2019). 三維環方格圖中的維度平均漢米爾頓迴圈之研究 [master's thesis, National Chi Nan University]. Airiti Library. https://doi.org/10.6837/ncnu201900193
- 何婉嫙（2010）。完全圖分割成4-迴圈或漢米爾頓迴圈之探討〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2010.00053
- Lee, H. C., & Yao, M. Y. (2012). 多重邊皇冠圖之4迴圈充填與覆蓋. 嶺東學報, (32), 1-17. https://doi.org/10.29850/LTJ.201212.0001