An axiomatization of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1189283 (Why is no real title available?)
- scientific article; zbMATH DE number 3692668 (Why is no real title available?)
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 3251427 (Why is no real title available?)
- scientific article; zbMATH DE number 3282607 (Why is no real title available?)
- A Kleene theorem for a class of planar acyclic graphs
- An algebraic presentation of term graphs, via gs-monoidal categories
- Classes of finite relations as initial abstract data types. I
- Context-free graph grammars and concatenation of graphs
- Ein Vollständigkeitssatz für Programme und Schaltkreise. (A completeness theorem for programs and switching circuits.)
- Graph expressions and graph rewritings
- Normal forms for algebras of connections.
- Parallel and two-way automata on directed ordered acyclic graphs
Cited in
(11)- A note on proofs with graphs
- Recognizability of graph and pattern languages
- Syntactic recognizability of graphs with fuzzy attributes
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
- The Syntactic Complexity of Eulerian Graphs
- scientific article; zbMATH DE number 3978423 (Why is no real title available?)
- Graph automata
- scientific article; zbMATH DE number 3598498 (Why is no real title available?)
- Constructing order type graphs using an axiomatic approach
- Minimization of planar directed acyclic graph algebras
- Simple Undirected Graphs as Formal Contexts
This page was built for publication: An axiomatization of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707454)