Paley graphs have Hamilton decompositions

DOI10.1016/J.DISC.2011.06.003zbMATH Open1232.05129OpenAlexW2049246407MaRDI QIDQ658027FDOQ658027

Authors: Brian Alspach, Danny Dyer, Darryn Bryant 

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.003

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Transversals and matroid partition
• Title not available (Why is that?)
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable
• Hamilton decompositions of Cartesian products of graphs
• Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens

Cited In (6)

• Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups
• Hamilton decompositions of regular expanders: applications
• Recent advances on the Hamiltonian problem: survey III
• Disjoint cycles in hypercubes with prescribed vertices in each cycle
• Edge-disjoint Hamilton cycles in random graphs
• 2-spanning cyclability problems of some generalized Petersen graphs

This page was built for publication: Paley graphs have Hamilton decompositions

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