Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730)
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: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships |
scientific article; zbMATH DE number 5383024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships |
scientific article; zbMATH DE number 5383024 |
Statements
Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (English)
0 references
17 December 2008
0 references
graph invariants
0 references
polytope
0 references
optimal linear inequalities
0 references
graphedron
0 references
0 references
0 references
0.8944435715675354
0 references
0.74591463804245
0 references
0.7321374416351318
0 references
0.7321374416351318
0 references
0.7293079495429993
0 references
