X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (8) 8
multipartite tournaments (6) 6
discrete mathematics and combinatorics (5) 5
theoretical computer science (5) 5
cycles (3) 3
regular 3-partite tournament (3) 3
3-partite tournaments (2) 2
almost regular multipartite tournaments (2) 2
complementary cycles (2) 2
cycle (2) 2
directed triangle free vertex (2) 2
multipartite tournament (2) 2
regular multipartite tournaments (2) 2
3-partite tournament (1) 1
almost regular (1) 1
arc (1) 1
componentwise complementary cycles (1) 1
connectivity (1) 1
digraphs (1) 1
diregular bipartite tournaments (1) 1
fixed arc (1) 1
hamiltonian cycles and paths (1) 1
hamiltonian path (1) 1
hamiltonian paths (1) 1
k-strong (1) 1
locally semicomplete digraphs (1) 1
longest cycle (1) 1
longest paths (1) 1
n-partite tournaments (1) 1
pancyclic oriented graphs (1) 1
pancyclicity (1) 1
paths (1) 1
regular 3-partite tournaments (1) 1
regular multipartite tournament (1) 1
semicomplete digraphs (1) 1
semicomplete multipartite digraphs (1) 1
tournament (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 05/2019, Volume 342, Issue 5, pp. 1223 - 1232
A c-partite tournament is an orientation of a complete c-partite graph. In 2006, Volkmann conjectured that every arc of a regular 3-partite tournament D is... 
Multipartite tournament | Regular 3-partite tournament | Cycle | MATHEMATICS | ARC
Journal Article
Discrete Mathematics, ISSN 0012-365X, 01/2016, Volume 339, Issue 1, pp. 17 - 20
A c-partite tournament is an orientation of a complete c-partite graph. In 2006, Volkmann conjectured that every arc of a regular 3-partite tournament D is... 
Regular multipartite tournament | 3-partite tournament | Multipartite tournament | Cycle | MATHEMATICS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 19, pp. 2482 - 2488
Let T be a 3-partite tournament. We say that a vertex v is C 3 ⃗ -free if v does not lie on any directed triangle of T . Let F 3 ( T ) be the set of the C 3 ⃗... 
Directed triangle free vertex | Regular 3-partite tournament
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 12, pp. 1198 - 1206
The vertex set of a digraph D is denoted by V ( D ) . A c-partite tournament is an orientation of a complete c-partite graph. In 1991, Jian-zhong Wang... 
3-partite tournaments | Multipartite tournaments | Regular multipartite tournaments | MATHEMATICS | multipartite tournaments | regular multipartite tournaments
Journal Article
DISCRETE MATHEMATICS, ISSN 0012-365X, 10/2010, Volume 310, Issue 19, pp. 2482 - 2488
Let T be a 3-partite tournament. We say that a vertex u is (C-3) over right arrow -free if v does not lie on any directed triangle of T. Let F-3 (T) be the set... 
MATHEMATICS | CYCLES | Directed triangle free vertex | Regular 3-partite tournament | MULTIPARTITE TOURNAMENTS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 22, pp. 2931 - 2942
If D is a digraph, then we denote by V ( D ) its vertex set. A multipartite or c -partite tournament is an orientation of a complete c -partite graph. The... 
Multipartite tournaments | Almost regular multipartite tournaments | 3-Partite tournaments | Longest cycle | 3-partite tournaments | MATHEMATICS | multipartite tournaments | SEMICOMPLETE MULTIPARTITE DIGRAPHS | almost regular multipartite tournaments | longest cycle
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2007, Volume 4489, Issue 3, pp. 347 - 352
Conference Proceeding
Discrete Mathematics, ISSN 0012-365X, 2007, Volume 307, Issue 24, pp. 3097 - 3129
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2004, Volume 281, Issue 1, pp. 255 - 266
A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. A... 
Multipartite tournaments | Regular multipartite tournaments | Complementary cycles | MATHEMATICS | LOCALLY SEMICOMPLETE DIGRAPHS | multipartite tournaments | complementary cycles | regular multipartite tournaments
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2004, Volume 285, Issue 1, pp. 267 - 278
A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. If x... 
Multipartite tournaments | Almost regular multipartite tournaments | Hamiltonian path | MATHEMATICS | multipartite tournaments | DIGRAPHS | almost regular multipartite tournaments | CYCLES
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.