Jacobsthal numbers in generalised Petersen graphs

From MaRDI portal
Publication:322296

DOI10.1016/J.ENDM.2015.06.065zbMATH Open1346.05226arXiv1503.03390OpenAlexW2296304975MaRDI QIDQ322296FDOQ322296

Jacob Günther, Henning Bruhn, Laura Gellert

Publication date: 14 October 2016

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).


Full work available at URL: https://arxiv.org/abs/1503.03390





Cites Work


Cited In (7)

Uses Software






This page was built for publication: Jacobsthal numbers in generalised Petersen graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322296)