A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
type: Item
instance of: scholarly article
title: A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
zbMATH Open document ID: 1258.91017
author: V. Leoni
author: M. P. Dobson
author: G. Nasini
published in: Discrete Optimization
publication date: 2013-03-13T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6144146
zbMATH Keywords: edge-perfect
zbMATH Keywords: graph
zbMATH Keywords: totally balanced game
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.disopt.2012.10.004
OpenAlex ID: W1996961942
DOI: 10.1016/J.DISOPT.2012.10.004
description: scientific article; zbMATH DE number 6144146