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

MaRDI QIDQ2848813zbMATH OpenFDO

Authors Xianchen Meng, Yan Zhang, Beiliang Du

Publication date 26 September 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

trianglefactorizationincomplete factorization

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The number of triangles in 2‐factorizations
• scientific article; zbMATH DE number 1080948
• scientific article; zbMATH DE number 1802824
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• scientific article; zbMATH DE number 1279026

Cited in

(4)

• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• scientific article; zbMATH DE number 749264 (Why is no real title available?)
• scientific article; zbMATH DE number 1080948 (Why is no real title available?)
• The number of triangles in 2‐factorizations

This page was built for publication: The number of triangles 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 Q2848813)