Antidirected Hamilton circuits and paths in tournaments

DOI10.1007/BF01427945zbMATH Open0241.05109MaRDI QIDQ2553373FDOQ2553373

Authors: Carsten Thomassen 

Publication date: 1973

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162389

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Antidirected Hamiltonian paths in tournaments

Cited In (13)

• Anti-Eulerian digraphs
• Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
• Antidirected Hamiltonian circuits in tournaments
• Oriented Hamiltonian cycles in tournaments
• Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2
• Ramsey numbers for tournaments
• Semi-degree threshold for anti-directed Hamiltonian cycles
• Tournaments and Semicomplete Digraphs
• Antidirected spanning closed trail in tournaments
• NC algorithms for antidirected hamiltonian paths and cycles in tournaments
• Paths and Cycles in Tournaments
• Ore conditions for antistrong digraphs
• Antidirected Hamiltonian paths between specified vertices of a tournament

This page was built for publication: Antidirected Hamilton circuits and paths in tournaments

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