Hamiltonian dicycles avoiding prescribed arcs in tournaments

DOI10.1007/BF01788546MaRDI QIDQ1090684zbMATH OpenOpenAlexFDO

Authors Pierre Fraisse, Carsten Thomassen

Publication date 1987

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788546

zbMATH Keywords

tournamentCamion's theoremHamiltonian dicyclek-connectedness

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
• Edge disjoint Hamiltonian cycles in highly connected tournaments
• Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments
• scientific article; zbMATH DE number 3887727
• Pancyclic arcs and connectivity in tournaments

Cites work

• scientific article; zbMATH DE number 3150485 (Why is no real title available?)
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• Hamiltonian-connected tournaments

Cited in

(8)

• Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
• Tournaments and Semicomplete Digraphs
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
• Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
• Semicomplete Multipartite Digraphs
• Spanning eulerian subdigraphs in semicomplete digraphs
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments

This page was built for publication: Hamiltonian dicycles avoiding prescribed arcs in tournaments

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