Antidirected Hamiltonian circuits in tournaments
From MaRDI portal
Publication:1394234
DOI10.1016/0095-8956(74)90069-0zbMath0279.05111OpenAlexW2040522478MaRDI QIDQ1394234
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
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
