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 -factorisations of a generalised Petersen graph of the type is equal to the th Jacobsthal number if is odd, and equal to , when is even. Moreover, we verify the list colouring conjecture for .
Full work available at URL: https://arxiv.org/abs/1503.03390
edge colouringJacobsthal numbers1-factorizationsgeneralized Petersen graphslist colouring conjecture
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- The list chromatic index of a bipartite multigraph
- Every generalized Petersen graph has a Tait coloring
- List edge colourings of some 1-factorable multigraphs
- Colorings and orientations of graphs
- The number of meets between two subsets of a lattice
- Jacobsthal numbers in generalised Petersen graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)