Construction techniques for linear realizations of multisets with small support

DOI10.1007/S11786-026-00627-7MaRDI QIDQ7315646zbMATH OpenFDO

Authors Onur Agirseven, M. A. Ollis

Publication date 18 August 2026

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11786-026-00627-7

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A generalization of the problem of Mariusz Meszka
• A new result on the problem of Buratti, Horak and Rosa
• Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
• Dihedral Hamiltonian cycle systems of the cocktail party graph
• Growable realizations: a powerful approach to the Buratti-Horak-Rosa conjecture
• Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
• New methods to attack the Buratti-Horak-Rosa conjecture
• On a generalization of the seating couples problem
• On a problem of Marco Buratti
• On a problem of Mariusz Meszka
• On Hamiltonian paths with prescribed edge lengths in the complete graph
• On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
• Partitions of nonzero elements of a finite field into pairs
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
• Seating couples around the king's table and a new characterization of prime numbers
• Spanning trees with specified differences in Cayley graphs
• The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP
• The seating couples problem in the even case

This page was built for publication: Construction techniques for linear realizations of multisets with small support

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