A planarity criterion for cubic bipartite graphs (Q1584420)
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 1524995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A planarity criterion for cubic bipartite graphs |
scientific article; zbMATH DE number 1524995 |
Statements
A planarity criterion for cubic bipartite graphs (English)
0 references
2 November 2000
0 references
planarity
0 references
cubic bipartite graphs
0 references
bipartition
0 references
polynomial-time algorithm
0 references
0.8154836297035217
0 references
0.7953124642372131
0 references
0.7941409349441528
0 references
0.7736318111419678
0 references
0.7605809569358826
0 references
