Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603): Difference between revisions

@@ Property / cites work @@
+Small transversals in hypergraphs
@@ Property / cites work: Small transversals in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+Extremal graphs for the identifying code problem
@@ Property / cites work: Extremal graphs for the identifying code problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of selected recent results on total domination in graphs
+Normal rank
@@ Property / cites work @@
+Hypergraphs with large transversal number and with edge sizes at least 3
+Normal rank
@@ Property / cites work @@
+Identifying vertex covers in graphs
@@ Property / cites work: Identifying vertex covers in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474266
@@ Property / cites work: Q4474266 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
+Normal rank
@@ Property / cites work @@
+On strongly identifying codes
@@ Property / cites work: On strongly identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+An upper bound for the transversal numbers of 4-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3565861
@@ Property / cites work: Q3565861 / rank @@
+Normal rank
@@ Property / cites work @@
+Open neighborhood locating-dominating in trees
@@ Property / cites work: Open neighborhood locating-dominating in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Total domination of graphs and small transversals of hypergraphs
+Normal rank
@@ Property / cites work @@
+Covering all cliques of a graph
@@ Property / cites work: Covering all cliques of a graph / rank @@
+Normal rank