Packing two graphs of order n having total size at most 2n-2 (Q803166)
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: Packing two graphs of order n having total size at most 2n-2 |
scientific article; zbMATH DE number 4200253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing two graphs of order n having total size at most 2n-2 |
scientific article; zbMATH DE number 4200253 |
Statements
Packing two graphs of order n having total size at most 2n-2 (English)
0 references
1990
0 references
packable graphs
0 references
complement
0 references
0.9078564643859864
0 references
0.8622139692306519
0 references
0.8440330624580383
0 references
0.8369882106781006
0 references
