On the domination number of a graph defined by containment (Q2332798): Difference between revisions

@@ Property / DOI @@
-.2140/moscow.2019.8.379
@@ Property / DOI: 10.2140/moscow.2019.8.379 / 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.2140/moscow.2019.8.379
+Normal rank
@@ Property / OpenAlex ID @@
+W2980106885
@@ Property / OpenAlex ID: W2980106885 / rank @@
+Normal rank
@@ Property / cites work @@
+The domination number of the graph defined by two levels of the \(n\)-cube
+Normal rank
@@ Property / cites work @@
+Q3728934
@@ Property / cites work: Q3728934 / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
+Normal rank
@@ Property / cites work @@
+Near perfect coverings in graphs and hypergraphs
@@ Property / cites work: Near perfect coverings in graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5781249
@@ Property / cites work: Q5781249 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127090482
@@ Property / Wikidata QID: Q127090482 / rank @@
+Normal rank
@@ Property / DOI @@
+.2140/MOSCOW.2019.8.379
@@ Property / DOI: 10.2140/MOSCOW.2019.8.379 / rank @@
+Normal rank