INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS-Reference-Cited by-同舟云学术

INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS

Published:2006-02 Issue:01 Volume:16 Page:119-140
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

JACKSON MARCEL¹,McKENZIE RALPH²

Affiliation:

1. Department of Mathematics, La Trobe University, Melbourne, Australia

2. Department of Mathematics, Vanderbilt University, Nashville, USA

Abstract

We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196706002846

Reference15 articles.

1. Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras

2. Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems

3. Finitely axiomatizable quasivarieties of graphs

4. Graph Theory and Probability

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Varieties of Involution J-Trivial Monoids with Continuum Many Subvarieties;Algebra Colloquium;2024-08-30

2. The Rees quotient monoid M(abba) generates a variety with uncountably many subvarieties;Semigroup Forum;2024-08-12

3. Representations and identities of Baxter monoids with involution;Semigroup Forum;2023-10

4. Representations and identities of hypoplactic monoids with involution;Communications in Algebra;2023-09-18

5. Historical Overview and Main Results;Advances in the Theory of Varieties of Semigroups;2022-08-27