Perfect 1-Factorizations of a Family of Cayley Graphs

DOI10.1002/jcd.21399zbMath1337.05053OpenAlexW1502957472WikidataQ114236276 ScholiaQ114236276MaRDI QIDQ3465907

Sarada Herke, Barbara M. Maenhaut

Publication date: 29 January 2016

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21399

zbMATH Keywords

Cayley graph1-factorizationperfect 1-factorization

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On the chromatic number of circulant graphs
• On 1-factorizability of Cayley graphs
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• A family of perfect factorisations of complete bipartite graphs
• Perfect 1-factorisations of circulants with small degree
• Finite topologies and Hamiltonian paths
• On a Class of Fixed-Point-Free Graphs
• One-factorizations of the complete graph—A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect 1-Factorizations of a Family of Cayley Graphs