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 条
  • [21] SUPERFLUOUS PATHS IN STRONG DIGRAPHS
    LUCCHESI, CL
    ROSS, JA
    DISCRETE MATHEMATICS, 1983, 47 (2-3) : 267 - 273
  • [22] Directed triangles in digraphs
    Shen, J
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (02) : 405 - 407
  • [23] On directed triangles in digraphs
    Hamburger, Peter
    Haxell, Penny
    Kostochka, Alexandr
    ELECTRONIC JOURNAL OF COMBINATORICS, 2007, 14 (01):
  • [24] DECOMPOSITIONS OF DIGRAPHS INTO PATHS AND CYCLES
    MAAMOUN, M
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (02) : 97 - 101
  • [25] LONGEST PATHS IN BIPARTITE DIGRAPHS
    AYEL, J
    DISCRETE MATHEMATICS, 1982, 40 (01) : 115 - 118
  • [26] Disjoint Paths in Decomposable Digraphs
    Bang-Jensen, Jorgen
    Christiansen, Tilde My
    Maddaloni, Alessandro
    JOURNAL OF GRAPH THEORY, 2017, 85 (02) : 545 - 567
  • [27] PARTITIONS OF DIGRAPHS INTO PATHS OR CIRCUITS
    BIENIA, W
    MEYNIEL, H
    DISCRETE MATHEMATICS, 1986, 61 (2-3) : 329 - 331
  • [28] Disjoint paths in symmetric digraphs
    Jarry, A.
    Perennes, S.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (01) : 90 - 97
  • [29] Paths and stability number in digraphs
    Fox, Jacob
    Sudakov, Benny
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [30] Disjoint A-paths in digraphs
    Kriesell, M
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (01) : 168 - 172
12345