A new planarity criterion for 3-connected graphs (Q3205249)
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 new planarity criterion for 3-connected graphs |
scientific article; zbMATH DE number 3646922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new planarity criterion for 3-connected graphs |
scientific article; zbMATH DE number 3646922 |
Statements
A new planarity criterion for 3-connected graphs (English)
0 references
1981
0 references
cycle
0 references
non-separating
0 references
3-connected graph
0 references
planar
0 references
graph planarity
0 references
graph decomposition
0 references
