Langford sequences: Perfect and hooked
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639635 (Why is no real title available?)
- scientific article; zbMATH DE number 3342009 (Why is no real title available?)
- On Langford’s Problem (I)
- On Langford’s Problem (II)
- On certain distributions of integers in pairs with given differences
- Some Remarks on the Triple Systems of Steiner.
- The Langford (4,n)-sequence: A trigonometric approach
Cited in
(50)- Skolem and Rosa rectangles and related designs
- Existence of BSAs and cyclic BSAs of block size three
- Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\)
- Hooked extended Langford sequences of small and large defects
- Pentagonal geometries with block sizes 3, 4, and 5
- Extended near Skolem sequences Part I
- Element neighbourhoods in twofold triple systems
- Quadratic leaves of maximal partial triple systems
- (Di)graph products, labelings and related results
- Constructions of cyclic quaternary constant-weight codes of weight three and distance four
- The intersection spectrum of Skolem sequences and its applications to -fold cyclic triple systems
- The existence of near-Skolem and hooked near-Skolem sequences
- Neighborhoods in maximum packings of 2K_n and quadratic leaves of triple systems
- The irregularity strength of \(tP_ 3\)
- Improved asymptotically optimal error correcting codes for avoidance crosstalk type-IV on-chip data buses
- A note on perfect systems of difference sets
- New optimal error-correcting codes for crosstalk avoidance in on-chip data buses
- Applying Skolem sequences to gracefully label new families of triangular windmills
- The spectrum of cyclic BSEC with block size three
- The existence of perfect (n m, 3, 2, 1)-geometric orthogonal codes
- Starter sequences and M-fold starter sequences: how can you begin?
- Perfect Skolem sets
- On (k,d)-Skolem graceful graphs
- Hooked k-extended Skolem sequences
- Cyclic antiautomorphisms of Mendelsohn triple systems
- Extended Langford sequences with small defects
- The existence of \((1,m)\)-near-Skolem sequences
- Generalized perfect difference families and their application to variable-weight geometric orthogonal codes
- Langford sequences and a product of digraphs
- Partitioning Steiner triple systems into complete arcs
- On a conjecture about \((m_1,m_2)\)-near-Skolem sequences
- Langford sequences: Some connections with complete and additive permutations
- The intersection spectrum of hooked Skolem sequences and applications
- The existence of (p,q)-extended Rosa sequences
- A construction for regular-graph designs
- Signed Langford sequences and directed cyclic cycle systems
- An arithmetic of complete permutations with constraints. I: An exposition of the general theory
- Signed Langford sequences
- Extended near Skolem sequences. II
- On the general Erdős conjecture for perfect systems of difference sets and embedding partial complete permutations
- Repeated blocks in indecomposable twofold triple systems
- Halving Steiner triple systems
- Strong Skolem starters
- TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS
- Group divisible designs with two associate classes: n=2 or m=2
- Enclosings of \(\lambda \)-fold 5-cycle systems: adding one vertex
- Note concerning an odd Langford sequence
- A survey of Skolem-type sequences and Rosa’s use of them
- Skolem labelled graphs
- Group divisible designs with two associate classes, and quadratic leaves of triple systems
This page was built for publication: Langford sequences: Perfect and hooked
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050986)
