Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355)
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: Characterization and recognition of P₄-sparse graphs partitionable into k independent sets and cliques |
scientific article; zbMATH DE number 5862853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques |
scientific article; zbMATH DE number 5862853 |
Statements
Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (English)
0 references
9 March 2011
0 references
0.88564646
0 references
0.8812059
0 references
0.8781093
0 references
0.8743452
0 references
0 references
0.8723095
0 references
0.87184393
0 references
0.8718119
0 references
0.8704226
0 references
