An axiomatization of graphs

DOI10.1007/s00236-004-0149-8zbMath1101.68064OpenAlexW2152115348MaRDI QIDQ707454

Symeon Bozapalidis, Antonios Kalampakas

Publication date: 9 February 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0149-8

zbMATH Keywords

magmoid of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

The Syntactic Complexity of Eulerian Graphs ⋮ Syntactic recognizability of graphs with fuzzy attributes ⋮ Graph automata ⋮ Recognizability of graph and pattern languages ⋮ Graph Automata: The Algebraic Properties of Abelian Relational Graphoids ⋮ MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of finite relations as initial abstract data types. I
• Context-free graph grammars and concatenation of graphs
• Normal forms for algebras of connections.
• A Kleene theorem for a class of planar acyclic graphs
• An algebraic presentation of term graphs, via gs-monoidal categories
• Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
• Graph expressions and graph rewritings
• Parallel and two-way automata on directed ordered acyclic graphs

This page was built for publication: An axiomatization of graphs