Supereulerian Digraphs with Large Arc-Strong Connectivity
نویسندگان
چکیده
Let D be a digraph and let λ(D) be the arc-strong connectivity of D, and α′(D) be the size of a maximum matching of D. We proved that if λ(D) ≥ α′(D) > 0, then D has a spanning eulerian subdigraph. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 393–402, 2016
منابع مشابه
Sufficient Conditions for a Digraph to be Supereulerian
A (di)graph is supereulerian if it contains a spanning, connected, eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we give a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the...
متن کاملOre-type degree condition of supereulerian digraphs
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 d+D (u) + d−D (v) ≥ |V (D)| − 4 for any pair of vertices u an...
متن کاملSupereulerian digraphs
A 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 digraphDwhich are not supereulerian under the condition that δ(D)+δ(D) ≥ |V (D)|−4. © 2014 Elsevier B.V. All rights reserved.
متن کاملA classification of arc-locally semicomplete digraphs
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
متن کاملConnectivity of some Algebraically Defined Digraphs
Let p be a prime, e a positive integer, q = pe, and let Fq denote the finite field of q elements. Let fi : Fq → Fq be arbitrary functions, where 1 6 i 6 l, i and l are integers. The digraph D = D(q; f), where f = (f1, . . . , fl) : Fq → Fq, is defined as follows. The vertex set of D is Fl+1 q . There is an arc from a vertex x = (x1, . . . , xl+1) to a vertex y = (y1, . . . , yl+1) if xi + yi = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 81 شماره
صفحات -
تاریخ انتشار 2016