The following pages link to Perfect codes in graphs (Q2559208):
Displayed 50 items.
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Worst-case efficient dominating sets in digraphs (Q1949100) (← links)
- On codes in the projective linear group \(\mathrm{PGL}(2,q)\) (Q1979940) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Perfect codes in Cayley sum graphs (Q2073316) (← links)
- Perfect domination ratios of Archimedean lattices (Q2088708) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Distance-regular graphs admitting a perfect 1-code (Q2113339) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- Efficient domination in Cayley graphs of generalized dihedral groups (Q2151216) (← links)
- Classification of efficient dominating sets of circulant graphs of degree 5 (Q2157841) (← links)
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196) (← links)
- Subgroup regular sets in Cayley graphs (Q2166283) (← links)
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098) (← links)
- On subgroup perfect codes in Cayley graphs (Q2225434) (← links)
- Packing parameters in graphs (Q2259558) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Perfect codes in the discrete simplex (Q2339137) (← links)
- Further applications of clutter domination parameters to projective dimension (Q2345543) (← links)
- Perfect codes in direct graph bundles (Q2346568) (← links)
- Constant 2-labellings and an application to \((r, a, b)\)-covering codes (Q2409782) (← links)
- Every grid has an independent \([1, 2]\)-set (Q2420403) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Efficient closed domination in digraph products (Q2424797) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- A Lloyd theorem in weakly metric association schemes (Q2641319) (← links)
- Neighbour-transitive codes and partial spreads in generalised quadrangles (Q2672306) (← links)
- Perfect codes in vertex-transitive graphs (Q2689009) (← links)
- Injective coloring of graphs revisited (Q2689514) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- Weighted perfect codes in Lee metric (Q2851506) (← links)
- Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs (Q2953402) (← links)
- Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs (Q3181045) (← links)
- (Open) packing number of some graph products (Q3386621) (← links)
- Perfect codes in direct products of cycles (Q3439335) (← links)
- Perfect codes in Cartesian products of hypercube and multidimensional grid (Q3439360) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- Perfect codes in the graphs <i>O<sub>k</sub></i> and <i>L(O<sub>k</sub>)</i> (Q3869391) (← links)
- UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE (Q4262044) (← links)
- Perfect Codes in Cayley Graphs (Q4604646) (← links)
- 1-perfect codes in Sierpiński graphs (Q4806494) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- On perfect and quasiperfect dominations in graphs (Q5005483) (← links)
- (Q5009468) (← links)
- Rainbow perfect domination in lattice graphs (Q5009971) (← links)
- On non-normal subgroup perfect codes (Q5026992) (← links)