Discriminating codes in (bipartite) planar graphs

DOI10.1016/J.EJC.2007.05.006zbMATH Open1143.94024OpenAlexW2009380125MaRDI QIDQ925038FDOQ925038

Authors: Irène Charon, Gérard Cohen, Olivier Hudry, Antoine Lobstein 

Publication date: 29 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.05.006

Recommendations

• Discriminating codes in bipartite graphs
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
• Complexity results for identifying codes in planar graphs
• Identifying codes in trees and planar graphs
• Some combinatorial aspects of constructing bipartite-graph codes
• Codes on planar Tanner graphs
• Constructions of binary codes based on bipartite graphs
• On a code problem concerning planar acyclic graphs
• scientific article; zbMATH DE number 9818
• Some classes of bipartite graphs induced by Gray codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• On identifying codes
• On a new class of codes for identifying vertices in graphs
• Title not available (Why is that?)
• Discriminating codes in bipartite graphs
• A linear algorithm for minimum 1-identifying codes in oriented trees

Cited In (17)

• Discriminating Codes in Geometric Setups
• Title not available (Why is that?)
• Planar Convex Codes are Decidable
• On a code problem concerning planar acyclic graphs
• Locating-domination and identification
• Separating codes and traffic monitoring
• Set graphs. II. Complexity of set graph recognition and similar problems
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
• Title not available (Why is that?)
• Discriminating codes in bipartite graphs
• Watching systems in graphs: an extension of identifying codes
• Extremal Digraphs for open neighbourhood location-domination and identifying codes
• Complexity results for identifying codes in planar graphs
• Complexity and approximation for discriminating and identifying code problems in geometric setups
• Separating codes and traffic monitoring
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity

This page was built for publication: Discriminating codes in (bipartite) planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925038)