Decompositions of complete graphs into circulants

DOI10.1016/J.DISC.2016.04.009MaRDI QIDQ294538zbMATH OpenOpenAlexFDO

Authors Mariusz Meszka, Martin Škoviera, Alexander Rosa, Roman Nedela

Publication date 16 June 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.04.009

zbMATH Keywords

decompositioncirculant

Mathematics Subject Classification ID

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

• Some results on decompositions of low degree circulant graphs
• Constructions for cyclic Moebius ladder systems
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
• Cycle decompositions of complete graphs

Cites work

• scientific article; zbMATH DE number 431053 (Why is no real title available?)
• scientific article; zbMATH DE number 3981181 (Why is no real title available?)
• scientific article; zbMATH DE number 140058 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 4123776 (Why is no real title available?)
• scientific article; zbMATH DE number 637292 (Why is no real title available?)
• scientific article; zbMATH DE number 1054728 (Why is no real title available?)
• A note on 3-factorizations of \(K_{10}\)
• A note on the decomposition of graphs into isomorphic matchings
• Constructions for cyclic Moebius ladder systems
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
• On perfect Γ-decompositions of the complete graph
• On the existence of balanced bipartite designs. II
• On the maximal number of independent circuits in a graph
• Sharply transitive decompositions of complete graphs into generalized Petersen graphs
• Strong difference families over arbitrary graphs
• The CRC handbook of combinatorial designs

Cited in

(19)

• scientific article; zbMATH DE number 2108151 (Why is no real title available?)
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
• Decomposing the complete \(r\)-graph
• A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS
• A new labeling of \(C_{2n}\) proves that \(K_4+M_{6n}\) decomposes \(K_{6n+4}\).
• scientific article; zbMATH DE number 5059992 (Why is no real title available?)
• Constructions for cyclic Moebius ladder systems
• The spectrum problem for the connected cubic graphs of order 10
• scientific article; zbMATH DE number 2235057 (Why is no real title available?)
• scientific article; zbMATH DE number 6605190 (Why is no real title available?)
• scientific article; zbMATH DE number 1549865 (Why is no real title available?)
• Circuit decompositions of Eulerian graphs
• On the cyclic decomposition of circulant graphs into bipartite graphs
• An existence theory for loopy graph decompositions
• Decomposition of complete graphs into small bipartite prisms
• scientific article; zbMATH DE number 890666 (Why is no real title available?)
• scientific article; zbMATH DE number 5844206 (Why is no real title available?)
• Commuting decompositions of complete graphs

This page was built for publication: Decompositions of complete graphs into circulants

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