INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS (Q5470161): Difference between revisions

@@ Property / cites work @@
+Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
+Normal rank
@@ Property / cites work @@
+Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
+Normal rank
@@ Property / cites work @@
+Finitely axiomatizable quasivarieties of graphs
@@ Property / cites work: Finitely axiomatizable quasivarieties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite semigroups whose varieties have uncountably many subvarieties
+Normal rank
@@ Property / cites work @@
+On chromatic number of finite set-systems
@@ Property / cites work: On chromatic number of finite set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+On classes of relations and graphs determined by subobjects and factorobjects
+Normal rank
@@ Property / cites work @@
+Checking quasi-identities in a finite semigroup may be computationally hard.
+Normal rank
@@ Property / cites work @@
+On the quasivarieties generated by finite semigroups
+Normal rank
@@ Property / cites work @@
+INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
@@ Property / cites work: INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS / rank @@
+Normal rank
@@ Property / cites work @@
+THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218196706002846
+Normal rank
@@ Property / OpenAlex ID @@
+W1976933099
@@ Property / OpenAlex ID: W1976933099 / rank @@
+Normal rank