Decomposition of complete graphs into unicyclic graphs with eight edges

MaRDI QIDQ5855396zbMATH OpenFDO

Authors Bryan Freyberg, Dalibor Fronček

Publication date 18 March 2021

zbMATH Keywords

tripartite unicyclic graph with eight edges

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7325724
• Decomposition of complete graphs into tri-cyclic graphs with eight edges
• Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges
• Decomposing complete equipartite graphs into connected unicyclic graphs of size five
• scientific article; zbMATH DE number 7706795

Cited in

(9)

• On the uniqueness of some girth eight algebraically defined graphs
• Decomposing complete equipartite graphs into connected unicyclic graphs of size five
• Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
• scientific article; zbMATH DE number 7325724 (Why is no real title available?)
• Decomposition of complete graphs into tri-cyclic graphs with eight edges
• Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges
• scientific article; zbMATH DE number 7706795 (Why is no real title available?)
• G-designs for the connected triangular bicyclic graphs with nine edges
• Decomposition of -fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges

This page was built for publication: Decomposition of complete graphs into unicyclic graphs with eight edges

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