Sufficient conditions for closed-trailable in digraphs
Changchang Dong, Hong Yang, Jixiang Meng, Juan Liu

TL;DR
This paper establishes new sufficient conditions involving degree sums and structural properties of subsets in digraphs that guarantee the existence of closed ditrails through all vertices of a subset, generalizing previous theorems on supereulerianity.
Contribution
It introduces generalized degree and structural conditions that ensure a subset is closed-trailable in digraphs, extending earlier results on supereulerian digraphs.
Findings
If a digraph is S-strong and degree sums meet the threshold, S is closed-trailable.
If a digraph is S-strictly strong with minimum semi-degree and matching number conditions, S is closed-trailable.
The results generalize previous theorems on supereulerianity in digraphs.
Abstract
A digraph with a subset of is called {\bf -strong} if for every pair of distinct vertices and of , there is a -dipath and a -dipath in . We define a digraph with a subset of to be {\bf -strictly strong} if there exist two nonadjacent vertices such that contains a closed ditrail through the vertices and ; and define a subset to be {\bf closed-trailable} if contains a closed ditrail through all the vertices of . In this paper, we prove that for a digraph with vertices and a subset of , if is -strong and if for any two nonadjacent vertices of , then is closed-trailable. This result generalizes the theorem of Bang-Jensen et al. \cite{BaMa14} on supereulerianity. Moveover, we show that for a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Optimization and Search Problems
