The cycle in 2-connected \([4,2]\)-graphs (Q5453045)
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: The cycle in 2-connected [4,2]-graphs |
scientific article; zbMATH DE number 5259898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cycle in 2-connected \([4,2]\)-graphs |
scientific article; zbMATH DE number 5259898 |
Statements
4 April 2008
0 references
\([s,t]\)-graph
0 references
\(k\)-connected
0 references
cycle
0 references
0.8313422799110413
0 references
0.8225643634796143
0 references
0.8225409388542175
0 references
0.8166397213935852
0 references
