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 条
  • [1] ANTI-DIRECTED SUBTREES OF DIRECTED-GRAPHS
    BURR, SA
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1982, 25 (01): : 119 - 120
  • [2] From Path Graphs to Directed Path Graphs
    Chaplick, Steven
    Gutierrez, Marisa
    Leveque, Benjamin
    Tondato, Silvia B.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 256 - +
  • [3] On Models of Directed Path Graphs Non Rooted Directed Path Graphs
    Gutierrez, Marisa
    Tondato, Silvia B.
    GRAPHS AND COMBINATORICS, 2016, 32 (02) : 663 - 684
  • [4] On Models of Directed Path Graphs Non Rooted Directed Path Graphs
    Marisa Gutierrez
    Silvia B. Tondato
    Graphs and Combinatorics, 2016, 32 : 663 - 684
  • [5] The isomorphism problem for directed path graphs and for rooted directed path graphs
    Babel, L
    Ponomarenko, IN
    Tinhofer, G
    JOURNAL OF ALGORITHMS, 1996, 21 (03) : 542 - 564
  • [6] Subtrees of graphs
    Chin, Alex J.
    Gordon, Gary
    MacPhee, Kellie J.
    Vincent, Charles
    JOURNAL OF GRAPH THEORY, 2018, 89 (04) : 413 - 438
  • [7] DIRECTED-GRAPHS WITH THE FIXED PATH-LENGTH PROPERTY AND PRODUCTS OF POINTS
    MENDELSOHN, NS
    PADMANABHAN, R
    WOLK, B
    UTILITAS MATHEMATICA, 1985, 28 : 129 - 135
  • [8] A nettree for simple paths with length constraint and the longest path in directed acyclic graphs
    Wu, Y.-X. (wuc567@163.com), 2012, Science Press (35):
  • [9] Directionality of real world networks as predicted by path length in directed and undirected graphs
    Rosen, Yonatan
    Louzoun, Yoram
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 401 : 118 - 129
  • [10] ON ROOTED DIRECTED PATH GRAPHS
    Gutierrez, Marisa
    Tondato, Silvia B.
    REVISTA DE LA UNION MATEMATICA ARGENTINA, 2016, 57 (01): : 111 - 144
12345