Decompositions of complete graphs into circulants

DOI10.1016/j.disc.2016.04.009zbMath1339.05322OpenAlexW2397430903MaRDI QIDQ294538

Martin Škoviera, Mariusz Meszka, 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

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

Related Items

The spectrum problem for the connected cubic graphs of order 10

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
• Constructions for cyclic Moebius ladder systems
• A note on the decomposition of graphs into isomorphic matchings
• Sharply transitive decompositions of complete graphs into generalized Petersen graphs
• On the existence of balanced bipartite designs. II
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• A note on 3-factorizations of K10
• Cycle decompositions III: Complete graphs and fixed length cycles
• Strong difference families over arbitrary graphs
• On perfect Γ-decompositions of the complete graph
• On the maximal number of independent circuits in a graph