On the perfect 1-factorisation problem for circulant graphs of degree 4

MaRDI QIDQ2938243zbMATH OpenFDO

Authors Sarada Herke

Publication date 14 January 2015

Full work available at URL http://ajc.maths.uq.edu.au//pdf/60/ajc_v60_p079.pdf

zbMATH Keywords

perfect matchingsperfect 1-factorisation

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect 1-factorisations of circulants with small degree
• Perfect 1-Factorizations of a Family of Cayley Graphs
• A family of perfect factorisations of complete bipartite graphs
• scientific article; zbMATH DE number 4118407
• On perfect one-factorization of the complete graph \(K_{2p}\)

Cited in

(2)

• Perfect 1-Factorizations of a Family of Cayley Graphs
• Perfect 1-factorisations of circulants with small degree

This page was built for publication: On the perfect 1-factorisation problem for circulant graphs of degree 4

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