Uniquely restricted matchings in subcubic graphs without short cycles

Abstract

AbstractA matching in a graph is uniquely restricted if no other matching in covers the same set of vertices. We prove that any connected subcubic graph with vertices and girth at least 5 contains a uniquely restricted matching of size at least except for two exceptional cubic graphs of order 14 and 20.