How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? (Q3710552)
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: How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? |
scientific article; zbMATH DE number 3937211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? |
scientific article; zbMATH DE number 3937211 |
Statements
How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged? (English)
0 references
1985
0 references
factorizations
0 references
complete graph
0 references
complete bipartite graphs
0 references
neighborly families
0 references
translations of the d-cube
0 references
0.7923468947410583
0 references
0.7860029339790344
0 references
0.7722232937812805
0 references
