1-Factorizations of Cayley graphs
classification
🧮 math.CO
math.GR
keywords
groupcayleygraphsorderconnectedeveryfactorizablefactorizations
read the original abstract
In 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.