How much semigroup structure is needed to encode graphs ?

DOI10.1051/ITA/1986200201911MaRDI QIDQ3735947zbMATH OpenOpenAlexFDO

Authors A. Goralčíková, Pavel Goralčík, Václav Koubek

Publication date 1986

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/1986200201911

zbMATH Keywords

critical varieties of finite semigroupsisomorphism completepolynomial time isomorphism algorithm

Mathematics Subject Classification ID

Lattices of varieties (08B15) Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
• Isomorphism Testing of Unary Algebras
• Finding the isomorphisms of 0-simple semigroups
• The isomorphism problem for varieties generated by a two-element algebra
• Minimal group-universal varieties of semigroups

Cited in

(2)

• Minimal group-universal varieties of semigroups
• COMBINATORIAL REES–SUSHKEVICH VARIETIES THAT ARE CROSS, FINITELY GENERATED, OR SMALL

This page was built for publication: How much semigroup structure is needed to encode graphs ?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735947)