A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (Q1941537)
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: A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games |
scientific article; zbMATH DE number 6144146
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games |
scientific article; zbMATH DE number 6144146 |
Statements
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (English)
0 references
13 March 2013
0 references
edge-perfect
0 references
graph
0 references
totally balanced game
0 references
NP-completeness
0 references
