A non-existence result on cyclic cycle-decompositions of the cocktail party graph
From MaRDI portal
Publication:1044940
DOI10.1016/j.disc.2008.05.042zbMath1214.05114MaRDI QIDQ1044940
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/457911
graceful labeling; complete graph; circulant graph; Oberwolfach problem; cocktail party graph; (1-rotational) 2-factorization; (cyclic) cycle-decomposition
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem, Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph, A complete solution to the two-table Oberwolfach problems, Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs, \(\phi\)-symmetric Hamilton cycle decompositions of graphs, The structure of 2-pyramidal 2-factorizations, Cyclic even cycle systems of the complete graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic survey of graph labeling
- Skolem-type difference sets for cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclically decomposing the complete graph into cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Some cyclic solutions to the three table Oberwolfach problem
- Cycle decompositions III: Complete graphs and fixed length cycles
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
