Discrete MathematicsVolume 330, 6 September 2014, Pages 87-95Supereulerian digraphs☆Author links open overlay panelYanmei Hong a, Hong-Jian Lai b, Qinghai Liu cShow moreShareCitehttps://doi.org/10.1016/j.disc.2014.04.018Get rights and contentUnder an Elsevier user licenseopen archiveAbstractA digraph D is supereulerian if D has a spanning directed eulerian subdigraph. We give a necessary condition for a digraph to be supereulerian first and then characterize the digraph D which are not supereulerian under the condition that δ+(D)+δ−(D)≥|V(D)|−4.Previous article in issueNext article in issueKeywordsSupereulerianRecommended articlesCited by (0)☆This research is supported in part by Fuzhou University (600880) and also in part by NSFC (11326214, 11301086).Copyright © 2014 Elsevier B.V. All rights reserved.