Decomposition of graphs into cycles of length seven and single edges.

zbMATH Open1349.05275MaRDI QIDQ2804806FDOQ2804806

Authors: Teresa Sousa 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Decompositions of graphs into 5-cycles and other small graphs
• Minimum \(H\)-decompositions of graphs
• scientific article; zbMATH DE number 7362657
• scientific article; zbMATH DE number 7274058
• \(C_7\)-decompositions of the tensor product of complete graphs

zbMATH Keywords

\(C_7\)-decomposition

Mathematics Subject Classification ID

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

Cited In (10)

• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• Decomposition of graphs into \((k,r)\)-fans and single edges
• Minimum \(H\)-decompositions of graphs: edge-critical case
• Minimum rainbow \(H\)-decompositions of graphs
• Minimum rainbow \(H\)-decompositions of graphs
• Turán number and decomposition number of intersecting odd cycles
• Turán function and \(H\)-decomposition problem for gem graphs
• Decompositions of graphs into 5-cycles and other small graphs
• An unusual decomposition of a complete 7-partite graph of order 28
• Monochromatic clique decompositions of graphs

This page was built for publication: Decomposition of graphs into cycles of length seven and single edges.

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