Discriminating codes in (bipartite) planar graphs
type: Item
instance of: scholarly article
title: Discriminating codes in (bipartite) planar graphs
zbMATH Open document ID: 1143.94024
author: Irène Charon
author: Gérard Cohen
author: Olivier Hudry
author: Antoine Lobstein
published in: European Journal of Combinatorics
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5280773
MaRDI profile type: Publication
full work available at URL: j.ejc.2007.05.006
OpenAlex ID: W2009380125
cites work: Discriminating codes in bipartite graphs
cites work: A linear algorithm for minimum 1-identifying codes in oriented trees
cites work: On identifying codes
cites work: Q4198056
cites work: On a new class of codes for identifying vertices in graphs
cites work: Q3684148
DOI: 10.1016/J.EJC.2007.05.006
Recommended article: Discriminating codes in bipartite graphs
Recommended article: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
Recommended article: Complexity results for identifying codes in planar graphs
Recommended article: Identifying codes in trees and planar graphs
Recommended article: Some combinatorial aspects of constructing bipartite-graph codes
Recommended article: Codes on planar Tanner graphs
Recommended article: Constructions of binary codes based on bipartite graphs
Recommended article: On a code problem concerning planar acyclic graphs
Recommended article: Q3971897
Recommended article: Some classes of bipartite graphs induced by Gray codes
description: scientific article; zbMATH DE number 5280773