Perfect codes in Cartesian products of 2-paths and infinite paths
zbMATH Open1081.05091MaRDI QIDQ2583665FDOQ2583665
Authors: Paul Dorbec, Michel Mollard
Publication date: 17 January 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125584
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other types of codes (94B60)
Cited In (13)
- Perfect codes in Cartesian products of hypercube and multidimensional grid
- Perfect \(r\)-codes in lexicographic products of graphs.
- Steganographic schemes from perfect codes on Cayley graphs
- Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
- Perfect codes in the \(\ell_p\) metric
- Rainbow perfect domination in lattice graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On perfect codes in Cartesian products of graphs
- Perfect codes in some products of graphs
- Weighted perfect codes in Lee metric
- Perfect domination ratios of Archimedean lattices
- Weighted codes in Lee metrics
This page was built for publication: Perfect codes in Cartesian products of 2-paths and infinite paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583665)