Discriminating codes in (bipartite) planar graphs

DOI10.1016/j.ejc.2007.05.006zbMath1143.94024OpenAlexW2009380125MaRDI QIDQ925038

Olivier Hudry, Irène Charon, Gérard D. Cohen, Antoine C. 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

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)

Related Items (10)

Complexity and approximation for discriminating and identifying code problems in geometric setups ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Separating codes and traffic monitoring ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Links Between Discriminating and Identifying Codes in the Binary Hamming Space ⋮ Discriminating Codes in Geometric Setups ⋮ 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 ⋮ Locating-Domination and Identification ⋮ Separating Codes and Traffic Monitoring

Cites Work

• A linear algorithm for minimum 1-identifying codes in oriented trees
• Discriminating codes in bipartite graphs
• On a new class of codes for identifying vertices in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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