A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set (Q2869469)
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: A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set |
scientific article; zbMATH DE number 6242738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set |
scientific article; zbMATH DE number 6242738 |
Statements
3 January 2014
0 references
0.89047694
0 references
0.89047503
0 references
0.8865459
0 references
0.8851656
0 references
0 references
0.8808338
0 references
0.8783024
0 references
0.87553024
0 references
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set (English)
0 references
