Claw-free \(t\)-perfect graphs can be recognized in polynomial time (Q2804992)
From MaRDI portal
| File:Ambox important.svg | 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: Claw-free \(t\)-perfect graphs can be recognized in polynomial time |
scientific article; zbMATH DE number 6578079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Claw-free \(t\)-perfect graphs can be recognized in polynomial time |
scientific article; zbMATH DE number 6578079 |
Statements
9 May 2016
0 references
\(t\)-perfect graphs
0 references
claw-free graphs
0 references
induced minors
0 references
Claw-free \(t\)-perfect graphs can be recognized in polynomial time (English)
0 references
