AbstractA connected graph Γ of even order is 𝑛-extendable, if it contains a matching of size 𝑛 and if every such matching is contained in a perfect matching of Γ. Furthermore, a connected graph Γ of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback