Deduction over graphs under constraints : a soundness and completeness theorem
Seyed-Kazem Lellahi, Nicolas Spyratos (1993)
Diagrammes
Similarity:
Displaying similar documents to “Rewriting on cyclic structures : equivalence between the operational and the categorical description”
Deduction over graphs under constraints : a soundness and completeness theorem
A graph structure over the category of sets and partial functions
Yoshihiro Mizoguchi (1993)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Hypergraph systems and their extensions
D. Janssens, G. Rozenberg (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the structure of recognizable languages of dependence graphs
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An introduction to -graphs, a graph-theoretic representation of natural numbers.
Farrell, E.J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Deductive systems and categories.
Došen, Kosta (1998)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
An economical transformation of graph grammars
A. Rudnicki (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some general classes of comatching graphs.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The periphery graph of a median graph
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...