A sufficient condition on upper embeddability of graphs (Q989758)
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: A sufficient condition on upper embeddability of graphs |
scientific article; zbMATH DE number 5774117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition on upper embeddability of graphs |
scientific article; zbMATH DE number 5774117 |
Statements
A sufficient condition on upper embeddability of graphs (English)
0 references
23 August 2010
0 references
maximum genus
0 references
connected graph
0 references
girth
0 references
upper embeddable
0 references
0 references
0 references
0.908424973487854
0 references
0.8910584449768066
0 references
0.8879034519195557
0 references
0.8792616724967957
0 references
