Antidirected Hamiltonian paths in tournaments

DOI10.1016/0095-8956(71)90035-9zbMath0198.29304OpenAlexW2030414567MaRDI QIDQ5920985

Branko Grünbaum

Publication date: 1971

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(71)90035-9

zbMATH Keywords

topology

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (29)

Antidirected paths in 5-chromatic digraphs ⋮ Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ The complexity of finding certain trees in tournaments ⋮ Equitable oriented coloring ⋮ Antidirected Hamiltonian circuits in tournaments ⋮ Antidirected spanning closed trail in tournaments ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ Ore conditions for antistrong digraphs ⋮ Antigerichtete Hamiltonlinien in vollständig gerichteten Graphen ⋮ \(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 ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian ⋮ Anti-Eulerian digraphs ⋮ Antidirected Hamiltonian paths and directed cycles in tournaments ⋮ Claws contained in all \(n\)-tournaments ⋮ Paths and Cycles in Tournaments ⋮ Ramsey numbers for tournaments ⋮ Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Parity of paths in tournaments ⋮ The antistrong property for special digraph families ⋮ Antidirected Hamiltonian paths in tournaments ⋮ Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture ⋮ Parity of paths and circuits in tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ On avoidable and unavoidable claws

Cites Work

• Nombre chromatique et plus longs chemins d'un graphe
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Antidirected Hamiltonian paths in tournaments