Weakly hamiltonian-connected vertices in bipartite tournaments (Q1892846): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jörgen Bang-Jensen / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jörgen Bang-Jensen / rank | |||
Normal rank | |||
Revision as of 05:53, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weakly hamiltonian-connected vertices in bipartite tournaments |
scientific article |
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
