Discriminating codes in (bipartite) planar graphs (Q925038): Difference between revisions

@@ Property / author @@
-Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
-Normal rank
@@ Property / author @@
+Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejc.2007.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2009380125
@@ Property / OpenAlex ID: W2009380125 / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs
@@ Property / cites work: Discriminating codes in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for minimum 1-identifying codes in oriented trees
+Normal rank
@@ Property / cites work @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q3684148
@@ Property / cites work: Q3684148 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:925038