Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time (Q5419013)
From MaRDI portal
scientific article; zbMATH DE number 6299382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time |
scientific article; zbMATH DE number 6299382 |
Statements
Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time (English)
0 references
2 June 2014
0 references
\(t\)-perfect graphs
0 references
claw-free graphs
0 references
induced minors
0 references
recognition algorithm
0 references
