paper

A Chvátal--Erdős type condition for supereulerian digraphs with

arXiv:2608.29101

Abstract

A digraph is \textbf{supereulerian} if it contains a spanning closed trail. Let denote the maximum cardinality of a vertex set inducing no 2-cycle. In this paper, we characterize supereulerianity in a strong digraph with by proving that a strong digraph with and is supereulerian if and only if does not belong to an exceptional family of -arc-strong digraphs with . Furthermore, every strong digraph satisfying and is supereulerian.

12 pages, 5 figures