Showing 2025Show all
3 papers · 1 filter
math.CO2025
Feedback vertex sets of digraphs with bounded maximum degree
Jiangdong Ai, Gregory Gutin, Xiangzhou Liu +2
A digraph is an oriented graph if does not have a pair of opposite arcs. The degree of a vertex of is the sum of the in-degree and out-degree of Let b…
math.CO2025
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
Gregory Gutin, Mads Anker Nielsen, Anders Yeo +1
Let be a digraph with at least one directed cycle. A set of arcs is a feedback arc set (FAS) if has no directed cycle. The FAS decomposition number ${\rm…
math.CO2025
Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
Jiangdong Ai, Qiwen Guo, Gregory Gutin +4
Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graph…