A recursive construction of asymmetric 1-factorizations (Q1244251): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114233918, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Finite topologies and Hamiltonian paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry groups of some perfect 1-factorizations of complete graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083442 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5648381 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of Room designs. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of automorphism free Steiner triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On one-factorizations of complete graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorics. Room squares, sum-free sets, Hadamard matrices / rank | |||
Normal rank |
Latest revision as of 21:56, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A recursive construction of asymmetric 1-factorizations |
scientific article |
Statements
A recursive construction of asymmetric 1-factorizations (English)
0 references
1977
0 references