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

zbMATH Open1278.05189MaRDI QIDQ2848813FDOQ2848813

Authors: Xianchen Meng, Yan Zhang, Beiliang Du 

Publication date: 26 September 2013

Published in: Utilitas Mathematica (Search for Journal in Brave)

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

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)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of triangles in 2‐factorizations
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)

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)