Sign Up to like & get
recommendations!
1
Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-016-1738-3
Abstract: A graph G is called a pseudo-core if every endomorphism of G is either an automorphism or a colouring. An interesting problem in graph theory is to distinguish whether a graph is a core. The…
read more here.
Keywords:
graphs;
endomorphisms twisted;
grassmann graphs;
graph ... See more keywords