A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Generalizations of tournaments: A survey
1998
Journal of Graph Theory
Preserved Fulltext
The reader will see that although these problems are polynomially solvable for all of the classes described, they can be highly non-trivial, even for these "tournament-like" digraphs. ...
The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. ...
tournaments are complementary pancyclic. ...
doi:10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-g
fatcat:urwonpylavfwzelzhggoojzk74
Results on degrees and the structure of 2-factors
2001
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We shall also consider some of the corresponding questions and development for digraphs. ...
Note that each digraph in T is 2-connected and locally semicomplete. ...
If D is a 2-connected locally semicomplete digraph on n ¿ 6 vertices; then D is complementary g(D)-pancyclic; unless D is isomorphic to a member of T ∪ {T 1 8 } ∪ R . ...
doi:10.1016/s0012-365x(00)00072-8
fatcat:ct7gzkpcevemzpqlggjpkl3yv4
Compositions of Digraphs: A Survey
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this survey we overview known results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. ...
Note that every round digraph is locally semicomplete. ...
By an evil locally semicomplete digraph we mean a locally semicomplete digraph that is not semicomplete and not round decomposable. ...
arXiv:2103.11171v1
fatcat:vdzzozqmajcgpnl5vwldcfn4l4
Cycles in multipartite tournaments: results and problems
2002
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Many results about cycles in tournaments are known, but closely related problems involving cycles in multipartite tournaments have received little attention until recently. ...
In particular, I am indebted to one of the referees for innumerable constructive suggestions and important hints that helped to consolidate the whole manuscript and to improve substantially the exposition ...
Guo and Volkmann [43, 45] extended this result to locally semicomplete digraphs. ...
doi:10.1016/s0012-365x(01)00419-8
fatcat:rg3yfj4nazaj5afljiv4hbyrvq
Multipartite tournaments: A survey
2007
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Many of the results in this paper are also valid for the more general class of semicomplete multipartite digraphs. ...
A vertex or an arc is pancyclic in a digraph D, if it belongs to an m-cycle for all m between 3 and |V (D)|. A digraph D is vertex pancyclic or arc pancyclic if every vertex or arc of D is pancyclic. ...
doi:10.1016/j.disc.2007.03.053
fatcat:25sft4ap2zat5o3iocbum4w3zy
Page 7217 of Mathematical Reviews Vol. , Issue 96m
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 96j:05004.}
96m:05095 05C20 05C38
Guo, Yubao (D-AACH-M2; Aachen);
Volkmann, Lutz (D-AACH-M2; Aachen)
Locally semicomplete digraphs that are complementary m-pancyclic. ...
Let D be a 2-connected locally semicomplete digraph with order n (n> 6). Denote by dp(A,B) the distance between any two subgraphs A and B. ...
Compositions of Digraphs: A Survey
[article]
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this survey we overview known results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. ...
Note that every round digraph is locally semicomplete. ...
By an evil locally semicomplete digraph we mean a locally semicomplete digraph that is not semicomplete and not round decomposable. ...
doi:10.48550/arxiv.2103.11171
fatcat:ms47jojkrfgw5o7gjjus6bdwfm
Page 125 of Mathematical Reviews Vol. 25, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) 93j:05065
Bang-Jensen, Jorgen A note on a special case of the 2-path problem for semicomplete digraphs. 93e:05038
— On the structure of locally semicomplete digraphs. 93g:05059
Barbut ...
On the complete digraphs which are simply disconnected. ...
Page 1555 of Mathematical Reviews Vol. 28, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
ISBN 3-211-82774-9 05-01
— (with Guo, Yubao) Locally semicomplete digraphs that are complementary m-pancyclic. (English summary) J. Graph Theory 21 (1996), no. 2, 121-136. ...
(Daniel Berend) 96k:11095 11K16
Volkmann, Lutz (with Guo, Yubao) On complementary cycles in locally semicomplete digraphs. (English summary) Discrete Math. 135 (1994), no. 1-3, 121-127. ...
Page 182 of Mathematical Reviews Vol. , Issue Subject Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Graphs which are edge-locally C,. ...
., 2001k:05119
Gutin, Gregory (with Tewes, Meike; Yeo, Anders) Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. ...