Graph imperfection. I
type: Item
instance of: scholarly article
title: Graph imperfection. I
zbMATH Open document ID: 1027.05043
author: Stefanie Gerke
author: Colin McDiarmid
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C17
zbMATH DE Number: 1843782
zbMATH Keywords: weighted colouring
zbMATH Keywords: imperfection ratio
zbMATH Keywords: perfect graphs
zbMATH Keywords: stable set polytope
zbMATH Keywords: radio channel assignment
MaRDI profile type: Publication
full work available at URL: jctb.2001.2042
OpenAlex ID: W2913391020
cites work: Choosability and fractional chromatic numbers
cites work: Polytope des independants d'un graphe série-parallèle
cites work: On certain polytopes associated with graphs
cites work: Unit disk graphs
cites work: Q3922703
cites work: Q5184939
cites work: Graph imperfection. II
cites work: On coloring unit disk graphs
cites work: Geometric algorithms and combinatorial optimization
cites work: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
cites work: 25 pretty graph colouring problems
cites work: (2 + ?)-Coloring of planar graphs with large odd-girth
cites work: The fractional chromatic number of mycielski's graphs
cites work: Q4792089
cites work: On the width—length inequality
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A characterization of perfect graphs
cites work: Q4540061
cites work: Graph imperfection and channel assignment
cites work: Channel assignment and weighted coloring
cites work: Sur le coloriage des graphs
cites work: Corrigendum: Static frequency assignment in cellular networks
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4382863
cites work: Q3818127
cites work: Improving heuristics for the frequency assignment problem
cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
cites work: Line perfect graphs
cites work: The Strong Perfect Graph Conjecture for Planar Graphs
cites work: Q4869540
cites work: Q3115277
DOI: 10.1006/JCTB.2001.2042
description: scientific article; zbMATH DE number 1843782