Weakly hamiltonian-connected vertices in bipartite tournaments (Q1892846): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1995.1019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028252114 / rank | |||
Normal rank | |||
Latest revision as of 19:36, 19 March 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
