1-Factorizations of Cayley graphs

Simple item page
dc.creatorAbdollahi, Alireza
dc.date2007-05-02
dc.date.accessioned2026-07-07T07:59:04Z
dc.date.available2026-07-07T07:59:04Z
dc.descriptionIn this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.
dc.identifierhttps://arxiv.org/abs/0705.0193
dc.identifierhttp://arxiv.org/abs/0705.0193
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128235
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject05C25;05C70
dc.title1-Factorizations of Cayley graphs
dc.typetext

Files

Collections

arXiv