Sufficient Ore type condition for a digraph to be supereulerian

Changchang Dong, Jixiang Meng and Juan Liu

Applied Mathematics and Computation, 2021, vol. 410, issue C

Abstract: A digraph D is called supereulerian if D has a spanning eulerian subdigraph. In this article, we show that a strong digraph D with n vertices is supereulerian if for every three different vertices z,w and v such that z and w are nonadjacent, d(z)+d(w)+d+(z)+d−(v)≥3n−5 (if (z,v)∉A(D)) and d(z)+d(w)+d−(z)+d+(v)≥3n−5 (if (v,z)∉A(D)). And this bound is sharp.

Keywords: Supereulerian digraph; Spanning eulerian subdigraph; Degree condition (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005592
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321005592

DOI: 10.1016/j.amc.2021.126470

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().