Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145): Difference between revisions

An ordinary multipartite tournament is an orientation of a complete \(k\)- partite graph such that, for any two partite classes, all arcs between them have the same direction. The authors characterize completely those ordinary multipartite tournaments which contain two vertices that are not connected by a directed Hamilton path.

0 references

reviewed by

Carsten Thomassen

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

multipartite tournament

0 references

Hamilton path

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)

0 references

Locally semicomplete digraphs: A generalization of tournaments

0 references

On the structure of locally semicomplete digraphs

0 references

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

0 references

Quasi‐transitive digraphs

0 references

Kings in quasi-transitive digraphs

0 references

Weakly hamiltonian-connected vertices in bipartite tournaments

0 references

Q3291037

0 references

Q4325297

0 references

Finding a Longest Path in a Complete Multipartite Digraph

0 references

Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey

0 references

On the structure of local tournaments

0 references

Hamiltonian-connected tournaments

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1842145

@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Locally semicomplete digraphs: A generalization of tournaments
+Normal rank
@@ Property / cites work @@
+On the structure of locally semicomplete digraphs
@@ Property / cites work: On the structure of locally semicomplete digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
+Normal rank
@@ Property / cites work @@
+Quasi‐transitive digraphs
@@ Property / cites work: Quasi‐transitive digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kings in quasi-transitive digraphs
@@ Property / cites work: Kings in quasi-transitive digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly hamiltonian-connected vertices in bipartite tournaments
+Normal rank
@@ Property / cites work @@
+Q3291037
@@ Property / cites work: Q3291037 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325297
@@ Property / cites work: Q4325297 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Longest Path in a Complete Multipartite Digraph
+Normal rank
@@ Property / cites work @@
+Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
+Normal rank
@@ Property / cites work @@
+On the structure of local tournaments
@@ Property / cites work: On the structure of local tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian-connected tournaments
@@ Property / cites work: Hamiltonian-connected tournaments / rank @@
+Normal rank