The number of 4-cycles in 2-factorizations of K₂n minus a 1-factor

DOI10.1016/S0012-365X(99)00377-5MaRDI QIDQ1567602zbMATH OpenOpenAlexWikidataFDO

Authors Elizabeth J. Billington, P. Adams, Italo J. Dejter, C. C. Lindner

Publication date 13 February 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00377-5

zbMATH Keywords

2-factorization4-cyclecomplete graph

Mathematics Subject Classification ID

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

Review text

For each positive integer \(n\), the authors determine all \(m\) so that there exists a 2-factorization of \(K_{2n} - F\), where \(F\) is a 1-factor, with exactly \(m\) 4-cycles.

Cited in

(4)

• scientific article; zbMATH DE number 1802824 (Why is no real title available?)
• A Search for Aliquot Cycles Below 10 10
• New amicable four-cycles
• scientific article; zbMATH DE number 2188330 (Why is no real title available?)

This page was built for publication: The number of 4-cycles in 2-factorizations of \(K_{2n}\) minus a 1-factor

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