Infinite families of bi-embeddings (Q917565): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q175610 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Širáň / rank | |||
Normal rank | |||
Revision as of 06:08, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite families of bi-embeddings |
scientific article |
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
