Name
Abstract | ||
|---|---|---|
First, we show that a necessary and sufficient condition for the existence of a C 3 -factorization of the symmetric tripartite digraph K n 1 ,n 2 ,n 3 ∗ , is n 1 = n 2 = n 3 . Next, we show that a necessary and sufficient condition for the existence of a C̄ 2k -factorization of the symmetric complete multipartite digraph K n 1 , n 2 ,…, n m is n 1 = n 2 = … = n m = 0 (mod k ) for even m and n 1 = n 2 = … = ≡ 0 (mod 2 k ) for odd m . |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0012-365X(98)00302-1 | Discrete Mathematics |
Keywords | DocType | Volume |
symmetric complete multipartite digraph,cycle-factorization | Journal | 199 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 3 |
PageRank | References | Authors |
0.57 | 5 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kazuhiko Ushio | 1 | 59 | 46.38 |