scientific article; zbMATH DE number 7352029

zbMath1465.05137MaRDI QIDQ4990121

Heather Jordon, Nichole Brown

Publication date: 28 May 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p234.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Langford sequencecomplete symmetric digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Rectangular Heffter arrays: a reduction theorem ⋮ Signed Langford sequences

Cites Work

• Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
• Langford sequences: Perfect and hooked
• Skolem-type difference sets for cycle systems
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• On certain distributions of integers in pairs with given differences
• Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
• A survey of Skolem-type sequences and Rosa’s use of them
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• On Langford’s Problem (II)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: