Oriented Hamiltonian cycles in tournaments

DOI10.1006/JCTB.2000.1959zbMATH Open1026.05052OpenAlexW1972602431MaRDI QIDQ1850481FDOQ1850481

Frédéric Havet

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:491a9bf1-2f73-4615-9640-d0d46b1a012f

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths and Cycles in Tournaments
• Title not available (Why is that?)
• Antidirected Hamiltonian circuits in tournaments
• On the existence of specified cycles in a tournament
• Antidirected Hamilton circuits and paths in tournaments
• Title not available (Why is that?)

Cited In (8)

• Learnability and rationality of choice.
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Almost symmetric cycles in large digraphs
• A survey on Hamilton cycles in directed graphs
• Hamiltonian Cycles in Regular Tournaments
• Tournaments and Semicomplete Digraphs
• Antidirected Hamiltonian paths and directed cycles in tournaments
• About the number of oriented Hamiltonian paths and cycles in tournaments

This page was built for publication: Oriented Hamiltonian cycles in tournaments

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