scientific article
From MaRDI portal
Publication:3517160
zbMath1201.05072MaRDI QIDQ3517160
Publication date: 12 August 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (7)
On identifying codes in the Cartesian product of a path and a complete graph ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Complexity results for identifying codes in planar graphs ⋮ New results of identifying codes in product graphs ⋮ Identifying Codes in Trees and Planar Graphs
This page was built for publication:
