2015/05/11 by Mansour J. Algefari, Hong‐Jian Lai · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems
paper · doi:10.1002/jgt.21885
openalex publication_date 2015/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Abstract Let D be a digraph and let be the arc‐strong connectivity of D , and be the size of a maximum matching of D . We proved that if , then D has a spanning eulerian subdigraph.