Cover Image

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ai, Jiangdong, Guo, Qiwen, Gutin, Gregory, Lan, Yongxin, Shao, Qi, Yeo, Anders, Zhou, Yacong
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Ai, Jiangdong, et al.
Published: (2024)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Odd Induced Subgraphs in Graphs of Maximum Degree Four
by: Ai, Jiangdong, et al.
Published: (2025)

Note on Long Directed Cycles in Eulerian Digraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

Average-case matrix discrepancy: satisfiability bounds
by: Maillard, Antoine
Published: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

An exact Ore-degree condition for Hamilton cycles in oriented graphs
by: Chang, Yulin, et al.
Published: (2025)

On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

Ore-type condition for antidirected Hamilton cycles in oriented graphs
by: Cai, Junqing, et al.
Published: (2025)

On semi-transitive orientability of circulant graphs
by: Srinivasan, Eshwar, et al.
Published: (2024)

Designing sparse temporal graphs satisfying connectivity requirements
by: Bellitto, Thomas, et al.
Published: (2026)

Forward Arc Maximization for Hamilton Oriented Cycles and Paths in Generalizations of Tournaments
by: Guo, Q., et al.
Published: (2026)

On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

Some short notes on oriented line graphs and related matrices
by: Antony, Jacob, et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Quasi-kernels in split graphs
by: Langlois, Hélène, et al.
Published: (2023)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Parameterised algorithms for temporally satisfying reconfiguration problems
by: Davot, Tom, et al.
Published: (2025)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
by: Caragiannis, Ioannis, et al.
Published: (2024)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Jiangdong Ai, et al.
Published: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)