Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646985 | Discrete Mathematics | 2016 | 9 Pages |
Abstract
A digraph D is supereulerian if D has a spanning directed eulerian subdigraph. Hong et al. proved that δ+(D)+δâ(D)â¥|V(D)|â4 implies D is supereulerian except some well-characterized digraph classes if the minimum degree is large enough. In this paper, we characterize the digraphs D which are not supereulerian under the condition dD+(u)+dDâ(v)â¥|V(D)|â4 for any pair of vertices u and v with uvâA(D) without the minimum degree constraint.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yanmei Hong, Qinghai Liu, Hong-Jian Lai,