Sk-factorization of symmetric complete tripartite digraphs

被引：0
|
作者：
Ushio, Kazuhiko
机构：
来源：
Discrete Mathematics | 1999年 / 197-198卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：791 / 797
相关论文
共 50 条
  • [21] Detecting genuine tripartite entanglement via general symmetric informationally complete measurements
    Hao, Jia
    Zhao, Hui
    Fei, Shao-Ming
    Xie, Chen
    Wang, Zhi-Xi
    PHYSICAL REVIEW E, 2023, 107 (05)
  • [22] Isomorphic factorization of de Bruijn digraphs
    Shibata, Y
    Hasunuma, T
    Fukuda, S
    DISCRETE MATHEMATICS, 2000, 218 (1-3) : 199 - 208
  • [23] On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles
    Francetic, Nevena
    Sajna, Mateja
    JOURNAL OF COMBINATORIAL DESIGNS, 2023, 31 (11) : 604 - 641
  • [24] Immersing complete digraphs
    DeVos, Matt
    McDonald, Jessica
    Mohar, Bojan
    Scheide, Diego
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (06) : 1294 - 1302
  • [25] Large vertex symmetric digraphs
    Gomez, J.
    NETWORKS, 2007, 50 (04) : 241 - 250
  • [26] Disjoint paths in symmetric digraphs
    Jarry, A.
    Perennes, S.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (01) : 90 - 97
  • [27] On the uniqueness of the factorization of power digraphs modulo n
    Sawkmie, Amplify
    Singh, Madan Mohan
    RENDICONTI DEL SEMINARIO MATEMATICO DELLA UNIVERSITA DI PADOVA, 2018, 140 : 185 - 219
  • [28] Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
    Wang, Chuchu
    Sun, Yuefang
    DISCRETE APPLIED MATHEMATICS, 2024, 358 : 203 - 213
  • [29] On the Cartesian skeleton and the factorization of the strong product of digraphs
    Hellmuth, Marc
    Marc, Tilen
    THEORETICAL COMPUTER SCIENCE, 2015, 565 : 16 - 29
  • [30] Orthogonal Decompositions of Complete Digraphs
    Sven Hartmann
    Graphs and Combinatorics, 2002, 18 : 285 - 302
12345