Perfectness of clustered graphs
type: Item
instance of: scholarly article
title: Perfectness of clustered graphs
zbMATH Open document ID: 1506.05061
author: Denis Cornaz
author: Tınaz Ekim
author: Bernard Ries
author: Flavia Bonomo
published in: Discrete Optimization
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6958402
zbMATH Keywords: selective coloring
zbMATH Keywords: partition coloring
zbMATH Keywords: conformal matrix
zbMATH Keywords: perfect matrix
zbMATH Keywords: threshold graph
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.07.006
OpenAlex ID: W2121607147
cites work: Routing and wavelength assignment by partition colouring
cites work: A branch-and-price approach for the partition coloring problem
cites work: On some applications of the selective graph coloring problem
cites work: Selective Graph Coloring in Some Special Classes of Graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: On certain polytopes associated with graphs
cites work: Combinatorial optimization. Packing and covering
cites work: Recognizing Berge graphs
cites work: Threshold graphs and related topics
DOI: 10.1016/J.DISOPT.2013.07.006
description: scientific article; zbMATH DE number 6958402