pith. sign in

arxiv: 1503.03390 · v1 · pith:DS4IB4FZnew · submitted 2015-03-11 · 🧮 math.CO

Jacobsthal numbers in generalised Petersen graphs

classification 🧮 math.CO
keywords equalgeneralisedjacobsthalnumberpetersencolouringconjectureeven
0
0 comments X
read the original abstract

We prove that the number of $1$-factorisations of a generalised Petersen graph of the type $GP(3k,k)$ is equal to the $k$th Jacobsthal number $J(k)$ if $k$ is odd, and equal to $4J(k)$, when $k$ is even. Moreover, we verify the list colouring conjecture for $GP(3k,k)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.