Decompositions of complete graphs into circulants

DOI10.1016/J.DISC.2016.04.009zbMATH Open1339.05322OpenAlexW2397430903MaRDI QIDQ294538FDOQ294538

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

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

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)

Cites Work

• The CRC handbook of combinatorial designs
• On the maximal number of independent circuits in a graph
• Title not available (Why is that?)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Title not available (Why is that?)
• Sharply transitive decompositions of complete graphs into generalized Petersen graphs
• On the existence of balanced bipartite designs. II
• A note on 3-factorizations of \(K_{10}\)
• Title not available (Why is that?)
• Strong difference families over arbitrary graphs
• On perfect Γ-decompositions of the complete graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (19)

• Title not available (Why is that?)
• 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}\).
• Title not available (Why is that?)
• Constructions for cyclic Moebius ladder systems
• Title not available (Why is that?)
• The spectrum problem for the connected cubic graphs of order 10
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Commuting decompositions of complete graphs
• Title not available (Why is that?)

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)