Antidirected Hamiltonian circuits in tournaments

DOI10.1016/0095-8956(74)90069-0zbMath0279.05111OpenAlexW2040522478MaRDI QIDQ1394234

D. Massart

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90069-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Antidirected Hamiltonian paths between specified vertices of a tournament, Arc reversals of cycles in orientations of \(G\) vertex-multiplications, The complexity of finding certain trees in tournaments, Almost symmetric cycles in large digraphs, Antidirected spanning closed trail in tournaments, About the number of oriented Hamiltonian paths and cycles in tournaments, \(k\)-ary spanning trees contained in tournaments, Realization of certain generalized paths in tournaments, Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2, NC algorithms for antidirected hamiltonian paths and cycles in tournaments, On claws belonging to every tournament, Anti-Eulerian digraphs, Claws contained in all \(n\)-tournaments, Paths and Cycles in Tournaments, Ramsey numbers for tournaments, Parity of paths in tournaments, Tournaments and Semicomplete Digraphs, On avoidable and unavoidable claws, Largest digraphs contained in all n-tournaments, Oriented Hamiltonian cycles in tournaments

Cites Work

• Antidirected Hamilton circuits and paths in tournaments
• Parity of paths and circuits in tournaments
• Disproof of a conjecture of Erdös and moser on tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments