Elsevier

Discrete Mathematics

Volume 103, Issue 2, 27 May 1992, Pages 209-220
Discrete Mathematics

Classifying 2-extendable generalized Petersen graphs

https://doi.org/10.1016/0012-365X(92)90271-GGet rights and content
Under an Elsevier user license
open archive

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≠2k or 3k whenever k⩾3, as conjectured by Cammack and Schrag.

Cited by (0)