Antidirected Hamiltonian paths in tournaments
Copyright policy ) M Rosenfeld;
Antidirected Hamiltonian paths in tournaments
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of antidirected Hamiltonian (ADH) paths in tournaments. We also prove that, in every tournament Tn with n ≥ 12, there is an ADH path starting at any vertex.
- Louisiana State University United States
Computational Theory and Mathematics, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, Theoretical Computer Science
Computational Theory and Mathematics, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).37 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
citations
Citations provided by BIP!
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 37
Top 10%
Top 1%
Average
hybrid
Fields of Science (3) View all