Author:
Remeslennikov Vladimir N.,Treier Alexander V.
Abstract
Abstract
In this paper we describe equivalence classes generated by finite graphs in the graph theory language without equality predicate. These classes coincide with classes of so called hard extensions of graphs.
Subject
General Physics and Astronomy
Reference6 articles.
1. Universal classes in the cathegory of simple graphs;Remeslennikov;J. Phys.: Conf. Ser.,2019
2. Orthogonal systems in finite graphs;Duncan;Siberian Electronical Mathematical Reports,2008
3. Characterization Classes Defined without Equality;Raimon;Studia Logica.,1997
4. HORNLOG: A graph-based interpreter for general Horn clauses;Gallier;The Journal of Logic Programming,1987