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 条

[11] A NOTE ABOUT A THEOREM BY MAAMOUN ON DECOMPOSITIONS OF DIGRAPHS INTO ELEMENTARY DIRECTED PATHS OR CYCLES
MEYNIEL, H
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 39 (03) : 368 - 370
[12] Packing paths in digraphs
Brewster, RC
He, P
Pantel, SH
Rizzi, R
Yeo, A
JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 81 - 94
[13] COVERING DIGRAPHS BY PATHS
LINIAL, N
DISCRETE MATHEMATICS, 1978, 23 (03) : 257 - 272
[14] ON CYCLES AND PATHS IN DIGRAPHS
HEYDEMANN, MC
DISCRETE MATHEMATICS, 1980, 31 (02) : 217 - 219
[15] LONGEST PATHS IN DIGRAPHS
BERMOND, JC
GERMA, A
HEYDEMANN, MC
SOTTEAU, D
COMBINATORICA, 1981, 1 (04) : 337 - 341
[16] Counting paths in digraphs
Seymour, Paul
Sullivan, Blair D.
EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (03) : 961 - 975
[17] ENUMERATION OF PATHS IN DIGRAPHS
PARTHASARATHY, KR
PSYCHOMETRIKA, 1964, 29 (02) : 153 - 165
[18] VARIABLE LENGTH CODES AND PATHS IN DIRECTED-GRAPHS
REUTENAUER, C
BULLETIN DE LA SOCIETE MATHEMATIQUE DE FRANCE, 1986, 114 (02): : 135 - 152
[19] An Excluded Half-Integral Grid Theorem for Digraphs and the Directed Disjoint Paths Problem
Kawarabayashi, Ken-ichi
Kobayashi, Yusuke
Kreutzer, Stephan
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 70 - 78
[20] DISJOINT PATHS IN ACYCLIC DIGRAPHS
METZLAR, A
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 57 (02) : 228 - 238

← 1 2 3 4 5 →