Perfect matchings in highly cyclically connected regular graphs

Abstract

A leaf matching operation on a graph consists of removing a vertex of degree 1 together with its neighbour from the graph. Let G be a d-regular cyclically d k ( − 1 + 2 )edge-connected graph of even order, where k 0 ≥ and