On decompositions of complete multipartite graphs into the union of two even cycles

MaRDI QIDQ5740783zbMATH OpenFDO

Authors

Publication date 20 July 2016

zbMATH Keywords

\(G\)-decompositionclicking

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 5200598
• Decompositions of complete multipartite graphs into cycles of even length
• scientific article; zbMATH DE number 1180724
• Decomposition of \(K_{m,n}\) into short cycles
• Cycle decompositions of the complete graph.

Cited in

(6)

• Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles
• Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles
• On decomposing the complete graph into the union of two disjoint cycles
• Decompositions of multigraphs into parts with two edges
• scientific article; zbMATH DE number 5226688 (Why is no real title available?)
• On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs

This page was built for publication: On decompositions of complete multipartite graphs into the union of two even cycles

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