3-trees with few vertices of degree 3 in circuit graphs (Q1011698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5542363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-trees with few vertices of degree 3 in circuit graphs |
scientific article; zbMATH DE number 5542363 |
Statements
3-trees with few vertices of degree 3 in circuit graphs (English)
0 references
9 April 2009
0 references
3-connected graph
0 references
circuit graph
0 references
3-tree
0 references
surface
0 references
0.7991347312927246
0 references
0.7789404392242432
0 references
0.7767267823219299
0 references
0.7723992466926575
0 references
