Balanced Foil Decomposition of Complete Graphs
スポンサーリンク
概要
- 論文の詳細を見る
Let t and n be positive integers. We show that the necessary and sufficient condition for the existence of a balanced t-foil decomposition of the complete graph K_n is n≡1(mod 6t). Decomposition algorithms are also given.
- 社団法人電子情報通信学会の論文
- 2001-12-01
著者
-
Ushio K
Kinki Univ. Higashi‐osaka‐shi Jpn
-
USHIO Kazuhiko
the Faculty of Science and Technology, Kinki University
-
FUJIMOTO Hideaki
the Faculty of Science and Technology, Kinki University
-
Fujimoto H
Kinki Univ. Higashi‐osaka‐shi Jpn
-
Fujimoto Hideaki
The Faculty Of Science And Technology Kinki University
-
Ushio Kazuhiko
The Faculty Of Science And Technology Kinki University
関連論文
- CYCLIC S_k-FACTORIZATION ALGORITHMS OF COMPLETE BIPARTITE GRAPHS
- Balanced Foil Decomposition of Complete Graphs
- A-1-21 Bigraph-factorization algorithm of symmetric complete bipartite multi-digraphs
- S4-Facotiization Algorithma of Complete Multipartite Graphs
- Balanced Quatrefoil Decomposition of Complete Multigraphs(Foundations of Computer Science)