Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles (Q1678094)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles |
scientific article; zbMATH DE number 6806767
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles |
scientific article; zbMATH DE number 6806767 |
Statements
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles (English)
0 references
14 November 2017
0 references
Bose construction for Steiner triple systems
0 references
0.8135809898376465
0 references
0.8132493495941162
0 references
