Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142)
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: Partitioning extended P₄-laden graphs into cliques and stable sets |
scientific article; zbMATH DE number 6098095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning extended \(P_4\)-laden graphs into cliques and stable sets |
scientific article; zbMATH DE number 6098095 |
Statements
Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (English)
0 references
23 October 2012
0 references
graph algorithms
0 references
graph partition
0 references
\((k
0 references
\ell )\)-graphs
0 references
\(P_{4}\)-laden graphs
0 references
\ell )\)-cocoloring
0 references
cliques
0 references
0.8476251363754272
0 references
0.8203291296958923
0 references
0.8081393837928772
0 references
0.7894128561019897
0 references
0.7740758061408997
0 references
