Graphs and free partially commutative monoids
From MaRDI portal
Recommendations
Cites work
- Combinatorial problems of commutation and rearrangements
- scientific article; zbMATH DE number 4162275 (Why is no real title available?)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
Cited in
(14)- Graph operations and free graph algebras
- Orthogonal systems in finite graphs
- scientific article; zbMATH DE number 2185579 (Why is no real title available?)
- Graph representations of a free Clifford monoid and a free semilattice with identity.
- The Fermi and Bose congruences for free semigroups on two generators
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- scientific article; zbMATH DE number 524138 (Why is no real title available?)
- The Number of Words of Length n in a Graph Monoid
- Reduced non-zero component union graph of free semi-modules
- Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
- Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids
- From monomials to words to graphs.
- On some decision problems for trace codings
- Möbius functions and confluent semi-commutations
This page was built for publication: Graphs and free partially commutative monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803150)