Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 05:41, 5 March 2024
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
