Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043)
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: Declawing a graph: polyhedra and branch-and-cut algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Declawing a graph: polyhedra and branch-and-cut algorithms |
scientific article |
Statements
Declawing a graph: polyhedra and branch-and-cut algorithms (English)
0 references
11 August 2021
0 references
graph declawing problem
0 references
claw-free graphs
0 references
branch-and-cut
0 references
polyhedral combinatorics
0 references
