Claw-free \(t\)-perfect graphs can be recognised in polynomial time (Q5419013)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6299382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9956915378570556
0 references
0.9099085927009584
0 references
0.8838037848472595
0 references
0.879086971282959
0 references
