The following pages link to (Q4368728):
Displaying 50 items.
- Double domination in lexicographic product graphs (Q777395) (← links)
- More on limited packings in graphs (Q782753) (← links)
- Introduction to ``Topics on Domination'' (Q804605) (← links)
- Domination dot-critical graphs (Q817744) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
- Domination number of catacondensed hexagonal systems (Q830892) (← links)
- Packing stars in fullerenes (Q830899) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Hardness results of global Roman domination in graphs (Q831760) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Transferable domination number of graphs (Q833006) (← links)
- Domination number in graphs with minimum degree two (Q839753) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Acyclic domination on bipartite permutation graphs (Q845701) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- A note on Roman domination in graphs (Q856892) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Critical cyclic patterns related to the domination number of the torus (Q864152) (← links)
- Minimizing the Laplacian eigenvalues for trees with given domination number (Q865427) (← links)
- \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent (Q868329) (← links)
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph (Q869572) (← links)
- Domination in partitioned graphs with minimum degree two (Q870974) (← links)
- Restricted domination in graphs with minimum degree 2 (Q878627) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- Statistical mechanics of the minimum dominating set problem (Q888266) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Super dominating sets in graphs (Q890164) (← links)
- Upper bounds on the signed total \((k, k)\)-domatic number of graphs (Q891310) (← links)
- Domination in 4-regular graphs with girth 3 (Q893494) (← links)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- Domination criticality in product graphs (Q896090) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Total domination in maximal outerplanar graphs. II. (Q897314) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- On dominating sets of maximal outerplanar and planar graphs (Q897600) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
