Boolean approach to planar embeddings of a graph (Q4271303)
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: Boolean approach to planar embeddings of a graph |
scientific article; zbMATH DE number 464618
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boolean approach to planar embeddings of a graph |
scientific article; zbMATH DE number 464618 |
Statements
Boolean approach to planar embeddings of a graph (English)
0 references
1 December 1993
0 references
planarity
0 references
spanning tree
0 references
planar embeddings
0 references
Hamiltonian planar graph
0 references
components
0 references
0.9576796
0 references
0.93181294
0 references
0 references
0.8927295
0 references
0.89154005
0 references
0.89154005
0 references
