ON THE LENGTH OF DIRECTED PATHS IN DIGRAPHS

被引:0
|
作者
Cheng, Yangyang [1 ]
Keevash, Peter [1 ]
机构
[1] Mathematical Institute, University of Oxford, Oxford, United Kingdom
关键词
D O I
10.1137/24M1648375
中图分类号
学科分类号
摘要
引用
收藏
页码:3134 / 3139
相关论文
共 50 条
  • [31] 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
  • [32] Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
    Chiba, Shuya
    Yoshida, Koshin
    DISCRETE MATHEMATICS, 2025, 348 (02)
  • [33] KERNELS BY MONOCHROMATIC DIRECTED PATHS IN m-COLORED DIGRAPHS WITH QUASI-TRANSITIVE CHROMATIC CLASSES
    Galeana-Sanchez, Hortensia
    Llano, Bernardo
    Jose Montellano-Ballesteros, Juan
    ARS COMBINATORIA, 2012, 106 : 461 - 471
  • [34] PERSISTENT DIRAC OF PATHS ON DIGRAPHS AND HYPERGRAPHS
    Suwayyid, Faisal
    Wei, Guo-wei
    FOUNDATIONS OF DATA SCIENCE, 2024, : 124 - 153
  • [35] Shortest Paths in Nearly Conservative Digraphs
    Kiraly, Zoltan
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 234 - 245
  • [36] CONNECTEDNESS OF DIGRAPHS THROUGH ALTERNATING PATHS
    BALCONI, G
    GRIECO, M
    ZUCCHETTI, B
    BOLLETTINO DELLA UNIONE MATEMATICA ITALIANA, 1983, 2A (02): : 147 - 153
  • [37] Longest paths in semicomplete multipartite digraphs
    Volkmann, L
    DISCRETE MATHEMATICS, 1999, 199 (1-3) : 279 - 284
  • [38] Tools for studying paths and cycles in digraphs
    Delorme, C
    Ordaz, O
    Quiroz, D
    NETWORKS, 1998, 31 (02) : 125 - 148
  • [39] Digraphs of directed treewidth one
    Wiederrecht, Sebastian
    DISCRETE MATHEMATICS, 2020, 343 (12)
  • [40] SHORT PATHS AND CONNECTIVITY IN GRAPHS AND DIGRAPHS
    FIOL, MA
    FABREGA, J
    ESCUDERO, M
    ARS COMBINATORIA, 1990, 29B : 17 - 31