Partitioning claw-free subcubic graphs into two dominating sets (Q2657047)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7324231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning claw-free subcubic graphs into two dominating sets |
scientific article; zbMATH DE number 7324231 |
Statements
Partitioning claw-free subcubic graphs into two dominating sets (English)
0 references
17 March 2021
0 references
dominating set
0 references
claw-free
0 references
subcubic graph
0 references
0.8404240608215332
0 references
0.8376237750053406
0 references
0.8341097235679626
0 references
0.8189418911933899
0 references
