The following pages link to Perfect codes in graphs (Q2559208):
Displaying 29 items.
- Rainbow perfect domination in lattice graphs (Q5009971) (← links)
- On non-normal subgroup perfect codes (Q5026992) (← links)
- The fullerene graphs with a perfect star packing (Q5056834) (← links)
- Perfect t-codes in Cayley graphs of groups (Q5063278) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- GROUP PERFECT CODE IN COMMUTING ORDER PRODUCT PRIME GRAPH (Q5075599) (← links)
- ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES (Q5076099) (← links)
- The (non-)existence of perfect codes in Lucas cubes (Q5089713) (← links)
- (Q5104007) (← links)
- Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)
- A note on the open packing number in graphs (Q5227166) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Stopping sets of codes from complete graph (Q5865694) (← links)
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups (Q5882598) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- The (non-)existence of perfect codes in Fibonacci cubes (Q5964828) (← links)
- A general construction of strictly Neumaier graphs and a related switching (Q6046159) (← links)
- Characterizing subgroup perfect codes by 2-subgroups (Q6048702) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs (Q6120125) (← links)
- On subgroup perfect codes in Cayley sum graphs (Q6191098) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
- Neighbour-transitive codes in Kneser graphs (Q6201495) (← links)
- A resource assignment problem on graphs (Q6487990) (← links)
- Perfect codes in \(m\)-Cayley hypergraphs (Q6611056) (← links)
- Complexity issues concerning the quadruple Roman domination problem in graphs (Q6658307) (← links)
