Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
From MaRDI portal
Publication:6567672
DOI10.1007/3-540-61576-8_75zbMath1543.051MaRDI QIDQ6567672
Yannis Manoussakis, Moshe Rosenfeld, Evripidis Bampis, Pavol Hell
Publication date: 5 July 2024
Extremal problems in graph theory (05C35) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
This page was built for publication: Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament