Graphs and free partially commutative monoids
From MaRDI portal
Publication:803150
DOI10.1016/0304-3975(91)90355-6zbMATH Open0727.05030OpenAlexW1995156548MaRDI QIDQ803150FDOQ803150
Authors: Roman König
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90355-6
Recommendations
clique-polynomialfree partially commutative monoids[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius-function&go=Go M��bius-function]
Cites Work
Cited In (13)
- The Fermi and Bose congruences for free semigroups on two generators
- Title not available (Why is that?)
- Graph representations of a free Clifford monoid and a free semilattice with identity.
- Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
- From monomials to words to graphs.
- Möbius functions and confluent semi-commutations
- Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids
- Title not available (Why is that?)
- Orthogonal systems in finite graphs
- Reduced non-zero component union graph of free semi-modules
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- Graph operations and free graph algebras
- On some decision problems for trace codings
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)