Recognizing claw-free perfect graphs (Q1118619): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing claw-free perfect graphs |
scientific article |
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
