AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem on automorphisms, we are considering endomorphisms of a graph in their relationship to endomorphisms of its derivative graph. Particularly, we characterize in this connection the graphs with the best endomorphisms
In this thesis, we consider questions relating to automorphisms and endomorphisms of countable, rel...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractFor any finite sequence of groups G0⊆G1⊆⋯;⊆Gn there exists an undirected graph (V, E) such t...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
AbstractWe show that for any group H (finite or infinite) there exists an independence structure wit...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractWe define two classes of mappings, between digraphs, which are closely related to homomorphi...
AbstractAutomorphisms σ of a connected graph X satisfying σ(F) ≠ F for all finite non-empty subsets ...
AbstractThe existence of groups which are not isomorphic with the group of automorphisms of any plan...
AbstractFor a homomorphism between directed graphs G1 and G2, its extension is the mapping of the se...
AbstractLet L be a subcomplex of a complex K. If the homomorphism from inclusion i∗:Hq(L)→Hq(K) is a...
In this thesis, we consider questions relating to automorphisms and endomorphisms of countable, rel...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractFor any finite sequence of groups G0⊆G1⊆⋯;⊆Gn there exists an undirected graph (V, E) such t...
AbstractWe prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M...
AbstractWe show that for any group H (finite or infinite) there exists an independence structure wit...
AbstractIn this paper we give an account of the different ways to define homomorphisms of graphs. Th...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractWe define two classes of mappings, between digraphs, which are closely related to homomorphi...
AbstractAutomorphisms σ of a connected graph X satisfying σ(F) ≠ F for all finite non-empty subsets ...
AbstractThe existence of groups which are not isomorphic with the group of automorphisms of any plan...
AbstractFor a homomorphism between directed graphs G1 and G2, its extension is the mapping of the se...
AbstractLet L be a subcomplex of a complex K. If the homomorphism from inclusion i∗:Hq(L)→Hq(K) is a...
In this thesis, we consider questions relating to automorphisms and endomorphisms of countable, rel...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
AbstractGraphs G and H are hypomorphic if there is a bijection φ: V(G) → V(H) such that G − u ≅ H − ...
DOI
Add to ORKG