Premium
Supereulerian Digraphs with Large Arc‐Strong Connectivity
Author(s) -
Algefari Mansour J.,
Lai HongJian
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21885
Subject(s) - digraph , arc (geometry) , eulerian path , mathematics , matching (statistics) , combinatorics , discrete mathematics , geometry , pure mathematics , statistics , lagrangian
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom