Abstract
Graph algebras establish a connection between graphs (i.e. binary relations) and universal algebras. A structure theorem of Birkhoff-type is given which characterizes graph varieties, i.e. classes of graphs which can be defined by identities for their corresponding graph algebras: A class of finite directed graphs without multiple edges is a graph variety iff it is closed with respect to finite restricted pointed subproducts and isomorphic copies. Several applications are given, e.g., every loopless finite directed graph is an induced subgraph of a direct power of a graph with three vertices. Graphs with bounded chromatic number or density form graph varieties characterizable by identities of special kind.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
