On endomorphism universality of sparse graph classes
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Density (toughness, etc.) (05C42) Structural characterization of families of graphs (05C75) Representation of semigroups; actions of semigroups on sets (20M30)
Cites work
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 3732083 (Why is no real title available?)
- scientific article; zbMATH DE number 3470451 (Why is no real title available?)
- scientific article; zbMATH DE number 665694 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 5492079 (Why is no real title available?)
- scientific article; zbMATH DE number 3240401 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- scientific article; zbMATH DE number 7681424 (Why is no real title available?)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A remark on contraction of graphs with given group
- A surprising permanence of old motivations (a not-so-rigid story)
- Algebraic graph theory. Morphisms, monoids and matrices
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Automorphism groups of geometrically represented graphs
- Automorphism groups of graphs and edge-contraction
- Automorphism groups of planar graphs. I
- Beyond symmetry in generalized Petersen graphs
- Direct products of cyclic semigroups admitting a planar Cayley graph.
- Endomorphism monoids and topological subgraphs of graphs
- Graph homomorphisms between trees
- Graphs of Degree Three with a Given Abstract Group
- Graphs of semigroups
- Graphs whose endomorphism monoids are regular
- Graphs with Given Group and Given Graph-Theoretical Properties
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
- Idempotent Semigroups
- Jordan-like characterization of automorphism groups of planar graphs
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- On graphs with a given endomorphism monoid
- On monoid graphs
- On planar right groups
- Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
- Quotients of rigid graphs
- Ranks of monoids of endomorphisms of a finite undirected path
- Relations (graphs) with given finitely generated semigroups
- Rings of sets
- Sparsity. Graphs, structures, and algorithms
- Symmetric relations (undirected graphs) with given semigroups
- The representation of finite groups, especially of the rotation groups of the regular bodies of three- and four-dimensional space, by Cayley's color diagrams.
- The structure of semigroups that admit outerplanar Cayley graphs.
- Theorie der endlichen und unendlichen Graphen. Kombinatorische Topologie der Streckenkomplexe.
- Towards a characterization of universal categories
- Universal partial order represented by means of oriented trees and other simple graphs
This page was built for publication: On endomorphism universality of sparse graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938662)
