Some characterization theorems on dominating chromatic partition-covering number of graphs (Q4979893)
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: Some characterization theorems on dominating chromatic partition-covering number of graphs |
scientific article; zbMATH DE number 6305610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some characterization theorems on dominating chromatic partition-covering number of graphs |
scientific article; zbMATH DE number 6305610 |
Statements
Some characterization theorems on dominating chromatic partition-covering number of graphs (English)
0 references
19 June 2014
0 references
dominating set
0 references
chromatic partition
0 references
dominating chromatic partition-covering number
0 references
0.8085860013961792
0 references
0.7644407153129578
0 references
0.7625102996826172
0 references
0.7598841786384583
0 references
0.7568308115005493
0 references
