Let T be a tournament of order $$n\ge 3$$ n ≥ 3 . A pair of distinct vertices x, y of T is called a min–max pair if one of x and y is of minimum out-degree, while the other is of maximum out-degree. Let xy be an arc such that x, y is a min–max pair. We call xy a min–max arc if x has minimum out-degree, and max–min arc otherwise. We prove that if yx is a min–max arc, then there exists a hamiltonian path from x to y; if xy is a max–min arc, then there exists a hamiltonian path from x to y with the exception of a few cases.
Graphs and Combinatorics – Springer Journals
Published: May 31, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera