Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431)
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: Computing the clique number of \(a\)-perfect graphs in polynomial time |
scientific article; zbMATH DE number 6222089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the clique number of \(a\)-perfect graphs in polynomial time |
scientific article; zbMATH DE number 6222089 |
Statements
1 November 2013
0 references
Computing the clique number of \(a\)-perfect graphs in polynomial time (English)
0 references
