Weak embedding of planar graphs (Q2504084)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weak embedding of planar graphs |
scientific article |
Statements
Weak embedding of planar graphs (English)
0 references
22 September 2006
0 references
A weak imbedding of a graph \(G\) is an imbedding of \(G\) for which all the region boundaries are closed walks. The authors find the weak maximum genus of some planar graphs. Also, those 2-connected planar graphs which can be weakly imbedded on surfaces (orientable or nonorientable) of positive genus are characterized.
0 references
