Abstract

Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair of parallel edges of $GP(n,k)$ is contained in a 1-factor of $GP(n,k)$. This partially answers a question posed by Larry Cammack and Gerald Schrag [Problem 101, Discrete Math. 73(3), 1989, 311-312].

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call