A sufficient condition for a bipartite graph to be a cube (Q1861237)
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: A sufficient condition for a bipartite graph to be a cube |
scientific article; zbMATH DE number 1882173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a bipartite graph to be a cube |
scientific article; zbMATH DE number 1882173 |
Statements
A sufficient condition for a bipartite graph to be a cube (English)
0 references
16 March 2003
0 references
antipodal and spherical graphs
0 references
bipartite graphs
0 references
hypercubes
0 references
0.7840368151664734
0 references
0.77726811170578
0 references
0.7614043354988098
0 references
0.7542902231216431
0 references
