Add to ORKGThe problem of deciding whether an arbitrary graph G has a homomorphism into a given graph H has been widely studied and has turned out to be very difficult. Hell and Nešetril proved that the decision problem is NP-complete unless H is bipartite. We consider a restricted problem where G is an arbitrary triangle-free hexagonal graph and H is a Kneser graph or its induced subgraph. We give an explicit construction which proves that any triangle-free hexagonal graph has a homomorphism into one-vertex deleted Petersen graph
AbstractA class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphi...
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the ver...
AbstractWe prove that for every graph H and positive integers k and l there exists a graph G with gi...
AbstractThe problem of deciding whether an arbitrary graph G has a homomorphism into a given graph H...
Abstract. The problem of deciding whether an arbitrary graph G has a homomorphism into a given graph...
AbstractThe problem of deciding whether an arbitrary graph G has a homomorphism into a given graph H...
Problem odločanja ali obstaja homomorfizem iz poljubnega grafa ▫$G$▫ v dani graf ▫$H$▫ je bil že več...
Abstract. Graph homomorphism, also called H-coloring, is a natural generaliza-tion of graph coloring...
AbstractLet H be a fixed graph whose vertices are called colours. Informally, an H-colouring of a gr...
For graphs G and H, an H-coloring of G is an edge-preserving mapping from V(G) to V(H). In the H-Col...
AbstractLet H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph...
AbstractFor every pair of finite connected graphs F and H, and every positive integer k, we construc...
AbstractFor a fixed graph H, the homomorphism problem for H is the problem of determining whether or...
AbstractA well-known result of Hell and Nešetřil 1992 states that if H is a fixed non-bipartite grap...
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the ver...
AbstractA class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphi...
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the ver...
AbstractWe prove that for every graph H and positive integers k and l there exists a graph G with gi...
AbstractThe problem of deciding whether an arbitrary graph G has a homomorphism into a given graph H...
Abstract. The problem of deciding whether an arbitrary graph G has a homomorphism into a given graph...
AbstractThe problem of deciding whether an arbitrary graph G has a homomorphism into a given graph H...
Problem odločanja ali obstaja homomorfizem iz poljubnega grafa ▫$G$▫ v dani graf ▫$H$▫ je bil že več...
Abstract. Graph homomorphism, also called H-coloring, is a natural generaliza-tion of graph coloring...
AbstractLet H be a fixed graph whose vertices are called colours. Informally, an H-colouring of a gr...
For graphs G and H, an H-coloring of G is an edge-preserving mapping from V(G) to V(H). In the H-Col...
AbstractLet H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph...
AbstractFor every pair of finite connected graphs F and H, and every positive integer k, we construc...
AbstractFor a fixed graph H, the homomorphism problem for H is the problem of determining whether or...
AbstractA well-known result of Hell and Nešetřil 1992 states that if H is a fixed non-bipartite grap...
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the ver...
AbstractA class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphi...
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the ver...
AbstractWe prove that for every graph H and positive integers k and l there exists a graph G with gi...