The property of \(k\)-colourable graphs is uniquely decomposable (Q383763)
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: The property of k-colourable graphs is uniquely decomposable |
scientific article; zbMATH DE number 6236042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The property of \(k\)-colourable graphs is uniquely decomposable |
scientific article; zbMATH DE number 6236042 |
Statements
The property of \(k\)-colourable graphs is uniquely decomposable (English)
0 references
6 December 2013
0 references
graph property
0 references
decomposable property
0 references
0 references
0.8689860701560974
0 references
0.8342506289482117
0 references
0.8272692561149597
0 references
