A class of self-orthogonal 2-sequencings

DOI10.1007/BF00157619zbMath0769.05056OpenAlexW2005058095MaRDI QIDQ1182413

Philip A. Leonard, B. A. Anderson

Publication date: 28 June 1992

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00157619

zbMATH Keywords

partitionsHamilton paths2-sequencingdivision of graphsterraces

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Biquadratic residues and self-orthogonal 2-sequencings ⋮ Orthogonal double covers of complete graphs by trees ⋮ More orthogonal double covers of complete graphs by Hamiltonian paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some howell designs of prime side
• Sequences in groups with distinct partial products
• On primitive polynomials over finite fields
• Edge partitions of the complete symmetric directed graph and related designs
• Self-orthogonal Hamilton path decompositions
• Equations over finite fields. An elementary approach
• Decomposition of the complete directed graph into k-circuits
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• A product theorem for 2-sequencings
• Block Designs with Cyclic Block Structure
• Primitive Normal Bases for Finite Fields

This page was built for publication: A class of self-orthogonal 2-sequencings