Optimizing weakly triangulated graphs
type: Item
instance of: scholarly article
title: Optimizing weakly triangulated graphs
zbMATH Open document ID: 0679.68082
DOI: 10.1007/BF01788689
author: Yanyan Li
published in: Graphs and Combinatorics
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4114006
zbMATH Keywords: weakly triangulated graphs
zbMATH Keywords: optimization problems
zbMATH Keywords: maximum clique
zbMATH Keywords: minimum colouring
zbMATH Keywords: maximum stable set
zbMATH Keywords: minimum clique covering
MaRDI profile type: Publication
Wikidata QID: Q56656645
cites work: Topics on perfect graphs
cites work: Q3216686
cites work: Weakly triangulated graphs
cites work: A new property of critical imperfect graphs and some consequences
full work available at URL: https://doi.org/10.1007/bf01788689
OpenAlex ID: W4230526896
DBLP publication ID: journals/gc/HaywardHM89
description: scientific article; zbMATH DE number 4114006