SUBTREES OF DIRECTED GRAPHS WITH NO PATH OF LENGTH EXCEEDING ONE

被引：3
|
作者：
GRAHAM, RL
机构：
来源：
CANADIAN MATHEMATICAL BULLETIN | 1970年 / 13卷 / 03期
关键词：
D O I：
10.4153/CMB-1970-063-1
中图分类号：
O7 [晶体学];
学科分类号：
0702 ; 070205 ; 0703 ; 080501 ;
摘要：
引用
收藏
页码：329 / &
相关论文
共 50 条
  • [41] VARIABLE LENGTH CODES AND PATHS IN DIRECTED-GRAPHS
    REUTENAUER, C
    BULLETIN DE LA SOCIETE MATHEMATIQUE DE FRANCE, 1986, 114 (02): : 135 - 152
  • [42] Directed Path-Width and Directed Tree-Width of Directed Co-graphs
    Gurski, Frank
    Rehs, Carolin
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 255 - 267
  • [43] Cycle decompositions IV: complete directed graphs and fixed length directed cycles
    Alspach, B
    Gavlas, H
    Sajna, M
    Verrall, H
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2003, 103 (01) : 165 - 208
  • [44] Maximum number of subtrees in cacti and block graphs
    Li, Jie
    Xu, Kexiang
    Zhang, Tianli
    Wang, Hua
    Wagner, Stephan
    AEQUATIONES MATHEMATICAE, 2022, 96 (05) : 1027 - 1040
  • [45] DIGRAPHS WITHOUT DIRECTED PATH OF LENGTH 2 OR 3
    SOTTEAU, D
    WOJDA, AP
    DISCRETE MATHEMATICS, 1986, 58 (01) : 105 - 108
  • [46] Average Shortest Path Length of Graphs of Diameter 3
    Shimizu, Nobutaka
    Mori, Ryuhei
    2016 TENTH IEEE/ACM INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP (NOCS), 2016,
  • [47] Length-constrained path-matchings in graphs
    Ghodsi, M
    Hajiaghayi, MT
    Mahdian, M
    Mirrokni, VS
    NETWORKS, 2002, 39 (04) : 210 - 215
  • [48] Constant tolerance intersection graphs of subtrees of a tree
    Jamison, RE
    Mulder, HM
    DISCRETE MATHEMATICS, 2005, 290 (01) : 27 - 46
  • [49] INDUCED SUBTREES IN GRAPHS OF LARGE CHROMATIC NUMBER
    GYARFAS, A
    SZEMEREDI, E
    TUZA, Z
    DISCRETE MATHEMATICS, 1980, 30 (03) : 235 - 244
  • [50] Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
    De Caria, Pablo
    DISCRETE APPLIED MATHEMATICS, 2022, 323 : 171 - 183
12345