\documentclass{rtaloop}


\begin{document}
\begin{problem}{Bruno Courcelle}{}{January 2005}

\begin{abstract}
  Equational axiomatization of graph operations
\end{abstract}

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 \cite{BauderonCourcelle87mst}.

\end{problem}
\end{document}