Weakly hamiltonian-connected vertices in bipartite tournaments (Q1892846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weakly hamiltonian-connected vertices in bipartite tournaments |
scientific article; zbMATH DE number 767694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weakly hamiltonian-connected vertices in bipartite tournaments |
scientific article; zbMATH DE number 767694 |
Statements
Weakly hamiltonian-connected vertices in bipartite tournaments (English)
0 references
2 July 1995
0 references
We characterize those bipartite tournaments which have a hamiltonian path with given unordered endvertices. Our proof gives rise to a polynomial algorithm to decide the existence of such a path and find one, if it exists.
0 references
tournaments
0 references
hamiltonian path
0 references
polynomial algorithm
0 references
0.8212236762046814
0 references
0.8195511102676392
0 references
0.8137808442115784
0 references
0.8134515881538391
0 references
