2‐connected coverings of bounded degree in 3‐connected graphs (Q4857433)
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: 2‐connected coverings of bounded degree in 3‐connected graphs |
scientific article; zbMATH DE number 821623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2‐connected coverings of bounded degree in 3‐connected graphs |
scientific article; zbMATH DE number 821623 |
Statements
2‐connected coverings of bounded degree in 3‐connected graphs (English)
0 references
30 May 1996
0 references
coverings
0 references
3-connected graph
0 references
sphere
0 references
torus
0 references
Klein bottle
0 references
2-connected spanning subgraph
0 references
maximum degree
0 references
0.8300821185112
0 references
0.8149940967559814
0 references
0.8144475221633911
0 references
0.8017425537109375
0 references
