ON THE LENGTH OF DIRECTED PATHS IN DIGRAPHS

被引：0
|
作者：
Cheng, Yangyang [1 ]
Keevash, Peter [1 ]
机构：
[1] Mathematical Institute, University of Oxford, Oxford, United Kingdom
来源：
SIAM Journal on Discrete Mathematics | 2024年 / 38卷 / 04期
关键词：
D O I：
10.1137/24M1648375
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：3134 / 3139
相关论文
共 50 条
  • [41] Paths, cycles and circular colorings in digraphs
    Wang, Guanghui
    Liu, Guizhen
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (21-23) : 1982 - 1985
  • [42] INFINITE HAMILTONIAN PATHS IN CAYLEY DIGRAPHS
    JUNGREIS, IL
    DISCRETE MATHEMATICS, 1985, 54 (02) : 167 - 180
  • [43] Note on Long Paths in Eulerian Digraphs
    Knierim, Charlotte
    Larcher, Maxime
    Martinsson, Anders
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [44] DIGRAPHS WITH MAXIMUM NUMBER OF PATHS AND CYCLES
    PERL, Y
    NETWORKS, 1987, 17 (03) : 295 - 305
  • [45] A matrix for counting paths in acyclic digraphs
    Stanley, RP
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) : 169 - 172
  • [46] On kernels by monochromatic paths in the corona of digraphs
    Wloch, Iwona
    CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2008, 6 (04): : 537 - 542
  • [47] Paths and cycles in extended and decomposable digraphs
    BangJensen, J
    Gutin, G
    DISCRETE MATHEMATICS, 1997, 164 (1-3) : 5 - 19
  • [48] Diameter, short paths and superconnectivity in digraphs
    Marcote, X
    Balbuena, C
    Pelayo, I
    DISCRETE MATHEMATICS, 2004, 288 (1-3) : 113 - 123
  • [49] On extremal weighted digraphs with no heavy paths
    Li, Binlong
    Zhang, Shenggui
    DISCRETE MATHEMATICS, 2010, 310 (10-11) : 1640 - 1644
  • [50] Directed Tree Connectivity of Symmetric Digraphs and Complete Bipartite Digraphs
    Yu, Junran
    JOURNAL OF INTERCONNECTION NETWORKS, 2023, 23 (03)
12345