Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

DOI10.1017/S0963548397003027zbMath0878.05036OpenAlexW2083532740MaRDI QIDQ4354587

Anders Yeo, Gregory Gutin, Jörgen Bang-Jensen

Publication date: 1 December 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003027

zbMATH Keywords

tournamenthamiltonian

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Multipartite tournaments: a survey ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Semicomplete Multipartite Digraphs

This page was built for publication: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments