A bijection between cliques in graphs and factorizations in free monoids

DOI10.1016/0304-3975(94)90286-0zbMath0938.68577OpenAlexW2053655031WikidataQ114214841 ScholiaQ114214841MaRDI QIDQ1341749

Jean-Claude Spehner

Publication date: 15 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90286-0

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20)

Cites Work

• Unnamed Item
• Sur la classification syntaxique
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• The complexity of theorem-proving procedures
• On cliques in graphs

This page was built for publication: A bijection between cliques in graphs and factorizations in free monoids