The following pages link to Approximating theDomatic Number (Q4785636):
Displaying 37 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Decomposition of multiple coverings into many parts (Q955226) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- Packing strong subgraph in digraphs (Q2684051) (← links)
- Domatic partitions and the Lovász local lemma (Q2768400) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- Deploying Robots With Two Sensors in<i>K</i><sub>1, 6</sub>-Free Graphs (Q3188660) (← links)
- Approximating the domatic number (Q3191980) (← links)
- A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
- A note on near-optimal coloring of shift hypergraphs (Q3467579) (← links)
- Algorithmic Aspects of Private Bayesian Persuasion. (Q4638086) (← links)
- (Q5158500) (← links)
- Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035) (← links)
- Energy Efficient Monitoring in Sensor Networks (Q5458549) (← links)
- Algorithms – ESA 2004 (Q5464578) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
