On the choice number of claw-free perfect graphs
type: Item
instance of: scholarly article
title: On the choice number of claw-free perfect graphs
zbMATH Open document ID: 1031.05055
DOI: 10.1016/S0012-365X(03)00292-9
author: Sylvain Gravier
author: Frédéric Maffray
published in: Discrete Mathematics
publication date: 2004-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C17
zbMATH DE Number: 2041907
zbMATH Keywords: Graph coloring
zbMATH Keywords: List coloring
zbMATH Keywords: Claw-free graphs
MaRDI profile type: Publication
cites work: Recognizing claw-free perfect graphs
cites work: Choice number of 3-colorable elementary graphs
cites work: Q4379734
cites work: Some upper bounds on the total and list chromatic numbers of multigraphs
cites work: The NP-Completeness of Edge-Coloring
cites work: A description of claw-free perfect graphs
full work available at URL: s0012-365x(03)00292-9
OpenAlex ID: W2004137491
Wikidata QID: Q56444938
DBLP publication ID: journals/dm/GravierM04
Recommended article: On the choosability of claw-free perfect graphs
Recommended article: The Structure of Claw‐Free Perfect Graphs
Recommended article: On claw-free \(t\)-perfect graphs
Recommended article: A description of claw-free perfect graphs
Recommended article: Clique-chromatic numbers of claw-free graphs
Recommended article: A characterization of claw-free \(b\)-perfect graphs
Recommended article: Clique-perfectness of claw-free planar graphs
Recommended article: Characterising claw-free \(t\)-perfect graphs
Recommended article: Strongly perfect claw‐free graphs—A short proof
Recommended article: On the Erdős-Gyárfás conjecture in claw-free graphs
description: scientific article; zbMATH DE number 2041907