| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651934 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
We prove that the number of 1-factorisations of a generalised Petersen graph of the type GP(3k,k) is equal to the kth 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).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
