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 条

[1] Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length
Shyu, Tay-Woei
GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1715 - 1725
[2] Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length
Tay-Woei Shyu
Graphs and Combinatorics, 2015, 31 : 1715 - 1725
[3] Disjoint directed and undirected paths and cycles in digraphs
Bang-Jensen, Jorgen
Kriesell, Matthias
THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5138 - 5144
[4] ON THE COMPLEXITY OF THE COLORFUL DIRECTED PATHS IN VERTEX COLORING OF DIGRAPHS
Saqaeeyan, S.
Mollaahmadi, E.
Dehghan, A.
TRANSACTIONS ON COMBINATORICS, 2013, 2 (02) : 1 - 7
[5] ANEULERIAN DIGRAPHS AND DETERMINATION OF THOSE EULERIAN DIGRAPHS HAVING AN ODD NUMBER OF DIRECTED EULERIAN PATHS
BERMAN, KA
DISCRETE MATHEMATICS, 1978, 22 (01) : 75 - 80
[6] DIGRAPHS WITHOUT DIRECTED PATH OF LENGTH 2 OR 3
SOTTEAU, D
WOJDA, AP
DISCRETE MATHEMATICS, 1986, 58 (01) : 105 - 108
[7] Spectra and elementary cycles of the digraphs with unique paths of fixed length
Wu, YK
Li, Q
Li, JJ
LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 293 (1-3) : 145 - 158
[8] BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS
CHEN, ZB
ZHANG, FJ
DISCRETE MATHEMATICS, 1988, 68 (01) : 9 - 13
[9] BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS
Chen Zibo Zhang Fuji
新疆大学学报(自然科学版)(中英文), 1989, (02) : 108 - 108
[10] DIRECTED GRAPHS WITH UNIQUE PATHS OF FIXED LENGTH
LAM, CWH
VANLINT, JH
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (03) : 331 - 337

← 1 2 3 4 5 →