A generalization of the problem of Mariusz Meszka

DOI10.1007/s00373-015-1563-0zbMath1331.05128arXiv1404.3890OpenAlexW1972034594MaRDI QIDQ5964995

Marco Antonio Pellegrini, Anita Pasotti

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.3890

zbMATH Keywords

Skolem sequencecomplete graphcyclic decompositionedge-lengthnear 1-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items

A problem on partial sums in abelian groups, New methods to attack the Buratti-Horak-Rosa conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new result on the problem of Buratti, Horak and Rosa
• On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
• On a problem of Mariusz Meszka
• Some progress on the existence of 1-rotational Steiner triple systems
• On a problem of Marco Buratti
• Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
• 1-Rotational Steiner triple systems over arbitrary groups
• Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric
• A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
• A survey of Skolem-type sequences and Rosa’s use of them
• Extended skolem sequences
• Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph