Classifying 2-extendable generalized Petersen graphs

Abstract

A graph is said to be 2-extendable if any two edges which do not have a common vertex are contained in a 1-factor of the graph. In this paper, we show that the generalized Petersen graph GP( n, k) is 2-extandable for all n≠2 k or 3 k whenever k⩾3, as conjectured by Cammack and Schrag.