Completing small partial triple systems (Q1053018): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Embedding Partial Steiner Triple Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every generalized Petersen graph has a Tait coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding partial Steiner triple systems is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Cyclic Steiner 2-Designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525397 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal consistent families of triples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The completion of finite incomplete Steiner triple systems with applications to loop theory / rank | |||
Normal rank |
Latest revision as of 09:48, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completing small partial triple systems |
scientific article |
Statements
Completing small partial triple systems (English)
0 references
1983
0 references
partial triple systems
0 references
double stars
0 references
cycle list
0 references
0 references