Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435)
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: Partitioning the vertices of a cubic graph into two total dominating sets |
scientific article; zbMATH DE number 7355967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning the vertices of a cubic graph into two total dominating sets |
scientific article; zbMATH DE number 7355967 |
Statements
Partitioning the vertices of a cubic graph into two total dominating sets (English)
0 references
7 June 2021
0 references
total domination
0 references
vertex partitions
0 references
5-chordal graphs
0 references
claw-free graph
0 references
0.95221037
0 references
0.95149666
0 references
0.91240025
0 references
0.9045599
0 references
0.89579594
0 references
0.89566374
0 references
