S4-Facotiization Algorithma of Complete Multipartite Graphs

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, it is shown that a necessary condition for the existence of an S4-factorization of K(m;n) is (i) mn≡0(mod 4)(ii)(m-1)n≡0(mod 6).Several sufficient conditions are also given.

• 一般社団法人情報処理学会の論文
• 1991-02-25

著者

• Ushio K

  Kinki Univ. Higashi‐osaka‐shi Jpn

• Ushio Kazuhiko

  Kinki Univ. Osaka Jpn

• Ushio Kazuhiko

  Kinki Univ.

• Tsuruno Reiji

  Kinki University

• Ushio Kazuhiko

  Kinki University

関連論文

• CYCLIC S_k-FACTORIZATION ALGORITHMS OF COMPLETE BIPARTITE GRAPHS
• Balanced Foil Decomposition of Complete Graphs
• Bowtie-decomposition algorithm and trefoil-decomposition algorithm of symmetric complete tripartite multi-digraphs
• A-1-3 Balanced (C_3, C_4, C_5)-Trefoil Decomposition Algorithm of Complete Graphs
• A-1-7 Balanced trefoil decomposition algorithm of complete graphs
• A-1-21 Bigraph-factorization algorithm of symmetric complete bipartite multi-digraphs
• A-1-6 Balanced bowtie decomposition algorithm of complete graphs
• S4-Facotiization Algorithma of Complete Multipartite Graphs
• A-024 Balanced (C_4, C_)-2t-Foil Decomposition Algorithm of Complete Graphs

スポンサーリンク