3 papers
math.CO2025
Ore-type condition for antidirected Hamilton cycles in oriented graphs
Junqing Cai, Guanghui Wang, Yun Wang +1
An antidirected cycle in a digraph is a subdigraph whose underlying graph is a cycle, and in which no two consecutive edges form a directed path in . Let be the…
math.CO2025
Arbitrary orientations of cycles in oriented graphs
Guanghui Wang, Yun Wang, Zhiwei Zhang
We show that every sufficiently large oriented graph with minimum indegree and outdegree both at least contains every orientation of a Hamilton cycle. This resu…
math.CO2025
An exact Ore-degree condition for Hamilton cycles in oriented graphs
Yulin Chang, Yangyang Cheng, Tianjiao Dai +2
An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph of sufficiently large order…