Counting strong digraphs

被引：0

作者：

Robinson, Robert W. ^{[1
]}

机构：

[1] University of Newcastle, United Kingdom

来源：

Journal of Graph Theory | 1977年 / 1卷 / 02期

关键词：

D O I：

10.1002/jgt.3190010215

中图分类号：

学科分类号：

摘要：

引用

页码：189 / 190

共 50 条

[41] Strong asymmetric digraphs with prescribed interior and annulus
Winters, SJ
CZECHOSLOVAK MATHEMATICAL JOURNAL, 2001, 51 (04) : 831 - 846
[42] Finding coherent cyclic orders in strong digraphs
Iwata, Satoru
Matsuda, Takuro
COMBINATORICA, 2008, 28 (01) : 83 - 88
[43] On the Cartesian skeleton and the factorization of the strong product of digraphs
Hellmuth, Marc
Marc, Tilen
THEORETICAL COMPUTER SCIENCE, 2015, 565 : 16 - 29
[44] ON LOCALLY N-(ARC)-STRONG DIGRAPHS
CHEN, ZB
ARS COMBINATORIA, 1994, 38 : 27 - 31
[45] (Strong) Total proper connection of some digraphs
Ma, Yingbin
Nie, Kairui
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (01) : 24 - 39
[46] Strong Asymmetric Digraphs with Prescribed Interior and Annulus
Steven J. Winters
Czechoslovak Mathematical Journal, 2001, 51 : 831 - 846
[47] HAMILTONIAN-COLORED POWERS OF STRONG DIGRAPHS
Johns, Garry
Jones, Ryan
Kolasinski, Kyle
Zhang, Ping
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2012, 32 (04) : 705 - 724
[48] Vertex-monochromatic connectivity of strong digraphs
Gonzalez-Moreno, Diego
Guevara, Mucuy-kak
Jose Montellano-Ballesteros, Juan
DISCRETE MATHEMATICS, 2020, 343 (09)
[49] The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
Bang-Jensen, J
Yeo, A
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 41 (01): : 1 - 19
[50] 4-TRANSITIVE DIGRAPHS I: THE STRUCTURE OF STRONG 4-TRANSITIVE DIGRAPHS
Hernandez-Cruz, Cesar
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (02) : 247 - 260

← 1 2 3 4 5 →