Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718): 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.1016/j.disc.2003.07.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017888452 / rank | |||
Normal rank | |||
Revision as of 19:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments |
scientific article |
Statements
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (English)
0 references
6 August 2004
0 references
A multipartite tournament is an orientation of a complete multipartite graph. The authors prove a sufficient condition for a multipartite tournament to contain a Hamiltom path starting with a given path. As a corollary, they show that every arc of a regular multipartite tournament is contained in a Hamilton path. They conjecture that every arc of a regular \(c\)-partite tournament is contained in a Hamilton cycle for each \(c\geq 4.\)
0 references
multipartite tournament
0 references
Hamilton path
0 references
regular
0 references
