On the computational complexity of defining sets (Q2387433): Difference between revisions

@@ Property / OpenAlex ID @@
+W1975073433
@@ Property / OpenAlex ID: W1975073433 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cs/0701008
@@ Property / arXiv ID: cs/0701008 / rank @@
+Normal rank
@@ Property / cites work @@
+On the forced matching numbers of bipartite graphs
+Normal rank
@@ Property / cites work @@
+On the spectrum of the forced matching number of graphs
+Normal rank
@@ Property / cites work @@
+Q4552244
@@ Property / cites work: Q4552244 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4211751
@@ Property / cites work: Q4211751 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4863423
@@ Property / cites work: Q4863423 / rank @@
+Normal rank
@@ Property / cites work @@
+The forcing geodetic number of a graph
@@ Property / cites work: The forcing geodetic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340871
@@ Property / cites work: Q3340871 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+On the minimum number of blocks defining a design
@@ Property / cites work: On the minimum number of blocks defining a design / rank @@
+Normal rank
@@ Property / cites work @@
+Q4887804
@@ Property / cites work: Q4887804 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the circular chromatic number
+Normal rank
@@ Property / cites work @@
+Defining sets in vertex colorings of graphs and latin rectangles
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank