Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

DOI10.1017/S0963548397003027zbMATH Open0878.05036OpenAlexW2083532740MaRDI QIDQ4354587FDOQ4354587

Authors: G. Gutin, A. Yeo, 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

Recommendations

• Hamiltonian dicycles avoiding prescribed arcs in tournaments
• Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
• scientific article; zbMATH DE number 969987
• The number of pancyclic arcs contained in a Hamiltonian cycle of a tournament

zbMATH Keywords

tournamenthamiltonian

Mathematics Subject Classification ID

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

Cited In (12)

• Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
• Extremal results on arc-traceable tournaments
• Title not available (Why is that?)
• Multipartite tournaments: a survey
• Hamiltonian Cycles in Regular Tournaments
• Tournaments and Semicomplete Digraphs
• Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
• Semicomplete Multipartite Digraphs
• Spanning eulerian subdigraphs in semicomplete digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Hamiltonian dicycles avoiding prescribed arcs in tournaments
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354587)