A new bound on the domination number of graphs with minimum degree two.
Henning, Michael A. ; Schiermeyer, Ingo ; Yeo, Anders
The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011), / Harvested from The Electronic Library of Mathematics
Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:225152
@article{05852462,
     title = {A new bound on the domination number of graphs with minimum degree two.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {18},
     year = {2011},
     zbl = {1209.05171},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05852462}
}
Henning, Michael A.; Schiermeyer, Ingo; Yeo, Anders. A new bound on the domination number of graphs with minimum degree two.. The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011) . http://gdmltest.u-ga.fr/item/05852462/