Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

GC
2010
Springer

110views Applied Computing» more GC 2010»

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs

15 years 1 months ago

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs

Download www.tu-ilmenau.de

Christian Löwenstein, Dieter Rautenbach

Real-time Traffic

Applied Computing | GC 2010 |

claim paper

Related Content

» Approximating the Domatic Number

» On the domination number of Hamiltonian graphs with minimum degree six

» Optimization problems in multiple subtree graphs

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireles...

» Approximating minimum size weaklyconnected dominating sets for clustering mobile ad hoc ne...

» Short length mengers theorem and reliable optical routing

» Total Domination and Matching Numbers in ClawFree Graphs

» Restricted domination parameters in graphs

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	GC
Authors	Christian Löwenstein, Dieter Rautenbach

Comments (0)