The following pages link to (Q3815323):
Displaying 50 items.
- On the efficiency index of a graph (Q266040) (← links)
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings (Q290097) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- Efficient domination in cubic vertex-transitive graphs (Q449200) (← links)
- A self-stabilizing algorithm for optimally efficient sets in graphs (Q456061) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Efficient sets in graphs (Q686251) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs (Q942091) (← links)
- Queen's domination using border squares and \((A,B)\)-restricted domination (Q942117) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- Roman domination in regular graphs (Q1024464) (← links)
- Minimum fractional dominating functions and maximum fractional packing functions (Q1025952) (← links)
- Reinforcement numbers of digraphs (Q1026162) (← links)
- Generalized domination and efficient domination in graphs (Q1126173) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- Efficient edge domination problems in graphs (Q1313728) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- The sequence of upper and lower domination, independence and irredundance numbers of a graph (Q1313851) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Efficient domination of the orientations of a graph (Q1377863) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Parity dimension for graphs (Q1584295) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Efficient location of resources in cylindrical networks (Q1646261) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
- Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (Q1799604) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups (Q2009004) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Efficient domination in Cayley graphs of generalized dihedral groups (Q2151216) (← links)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
- Domination in rose window graphs (Q2227966) (← links)
