Relative expressiveness of the edge/adjacency language for graph theory

DOI10.4064/FM-123-3-163-167MaRDI QIDQ3220638zbMATH OpenOpenAlexFDO

Authors Terry A. McKee

Publication date 1984

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/211532

zbMATH Keywords

edge isomorphismlanguages for graphsvertex isomorphism

Mathematics Subject Classification ID

General logic (03B99) Graph theory (05C99)

Recommendations

• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• The Complexity of Defining a Relation on a Finite Graph
• Mathematical Foundations of Computer Science 2005
• On the Expressive Power of Graph Logic
• scientific article; zbMATH DE number 1059243

Cited in

(1)

• Characteristics of graph languages generated by edge replacement

This page was built for publication: Relative expressiveness of the edge/adjacency language for graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220638)