Jacobsthal numbers in generalised Petersen graphs

DOI10.1016/j.endm.2015.06.065zbMath1346.05226arXiv1503.03390OpenAlexW2296304975MaRDI QIDQ322296

Henning Bruhn, Laura Gellert, Jacob H. Gunther

Publication date: 14 October 2016

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

zbMATH Keywords

edge colouringgeneralized Petersen graphsJacobsthal numbers1-factorizationslist colouring conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Jacobsthal numbers in generalised Petersen graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Adjacency-Jacobsthal numbers

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jacobsthal numbers in generalised Petersen graphs
• The number of meets between two subsets of a lattice
• Colorings and orientations of 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
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Self-dual configurations and regular graphs

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