Infinite families of bi-embeddings (Q917565)
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 4156457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infinite families of bi-embeddings |
scientific article; zbMATH DE number 4156457 |
Statements
Infinite families of bi-embeddings (English)
0 references
1990
0 references
A graph G is said to be \((p_ 1,p_ 2)\) bi-embeddable if there exist two subgraphs \(H_ 1\) and \(H_ 2\) of G, \(H_ 1\cup H_ 2=G\) such that \(H_ i\) is embeddable on an orientable surface of genus \(p_ i\) \((i=1,2)\). Infinite families of bi-embeddings of complete graphs are obtained.
0 references
bi-embeddings
0 references
complete graphs
0 references
0.8061797022819519
0 references
0.788232147693634
0 references
0.77851802110672
0 references
