[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]

Problem #103

Originator: Bruno Courcelle
Date: January 2005

Summary: Equational axiomatization of graph operations

Given a set of graph operations like disjoint union, edge-complement, quantifier-free definable operations (like relabellings). When can one axiomatize its equational theory by finitely many equational rules or by infinitely many rules describable in finitary ways?

See [BC87].

References

[BC87]

Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20(2–3):83–127, 1987.

[Submit a comment] [RTALooP home] [Index] [Previous] [Next]

[Postscript] [PDF] [BibTeX Source] [LaTeX Source]