Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1008.1608 / rank
 
Normal rank

Revision as of 14:17, 19 April 2024

scientific article
Language Label Description Also known as
English
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
scientific article

    Statements

    Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2012
    0 references
    alternating Hamiltonian cycle
    0 references
    block intersection graph
    0 references
    group divisible design
    0 references
    minimum covering
    0 references
    sequence of radius two
    0 references
    Steiner triple system
    0 references
    universal cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references