Recognizing claw-free perfect graphs (Q1118619)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recognizing claw-free perfect graphs |
scientific article; zbMATH DE number 4095514
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing claw-free perfect graphs |
scientific article; zbMATH DE number 4095514 |
Statements
Recognizing claw-free perfect graphs (English)
0 references
1988
0 references
A claw is a graph with vertices w,x,y,z and edges wx,wy,wz; a graph is called claw-free if none of its induced subgraphs is a claw. The paper presents an algorithm to recognize claw-free perfect graphs, which requires a polynomial time.
0 references
claw-free graph
0 references
chromatic number
0 references
perfect graphs
0 references
