Up-embeddability and independent number of simple graphs. (Q4649982)
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: Up-embeddability and independent number of simple graphs. |
scientific article; zbMATH DE number 6107227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Up-embeddability and independent number of simple graphs. |
scientific article; zbMATH DE number 6107227 |
Statements
15 November 2012
0 references
up-embeddability
0 references
maximum genus
0 references
independence number
0 references
0.9000340104103088
0 references
0.8888809084892273
0 references
0.8870029449462891
0 references
0.8838038444519043
0 references
0.8835964798927307
0 references
