Let D be a digraph and let lambda(D) be the arc-strong connectivity of D, and alpha' be the size of a maximum matching of D. We proved that if lambda(D) alpha' (D) > 0 then D has a spanning eulerian subdigraph.
Metrics
1 Record Views
Details
Title
Supereulerian Digraphs with Large Arc-Strong Connectivity