Paired-domination in claw-free graphs with minimum degree at least four. (Q2829059)
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: Paired-domination in claw-free graphs with minimum degree at least four. |
scientific article; zbMATH DE number 6644251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Paired-domination in claw-free graphs with minimum degree at least four. |
scientific article; zbMATH DE number 6644251 |
Statements
26 October 2016
0 references
paired-domination
0 references
claw-free graph
0 references
minimum degree
0 references
Paired-domination in claw-free graphs with minimum degree at least four. (English)
0 references
0.979149580001831
0 references
0.9581378698349
0 references
0.946673572063446
0 references
0.9364578723907472
0 references
0.9135371446609496
0 references
