Packing \(K_r\)s in bounded degree graphs (Q6497939)
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: Packing K_rs in bounded degree graphs |
scientific article; zbMATH DE number 7843500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing \(K_r\)s in bounded degree graphs |
scientific article; zbMATH DE number 7843500 |
Statements
Packing \(K_r\)s in bounded degree graphs (English)
0 references
6 May 2024
0 references
\(K_r\)-packing
0 references
clique packing
0 references
vertex-disjoint triangles
0 references
edge-disjoint triangles
0 references
triangle packing
0 references
claw-free graphs
0 references
0 references
0.8596656918525696
0 references
0.8591127991676331
0 references
0.8520888686180115
0 references
0.8293425440788269
0 references
