2 papers
math.CO2016
Covering a cubic graph by 5 perfect matchings
Wuyang Sun
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjec…
math.CO2012
3-Factor-criticality of vertex-transitive graphs
Heping Zhang, Wuyang Sun
A graph of order is -factor-critical, where is an integer of the same parity as , if the removal of any set of vertices results in a graph with a perfect matching…