Hamiltonian dicycles avoiding prescribed arcs in tournaments
From MaRDI portal
Publication:1090684
DOI10.1007/BF01788546zbMath0622.05028OpenAlexW2048972313MaRDI QIDQ1090684
Carsten Thomassen, Pierre Fraisse
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788546
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Semicomplete Multipartite Digraphs
Cites Work
This page was built for publication: Hamiltonian dicycles avoiding prescribed arcs in tournaments
