DOIAbstract
AbstractWe show that if H is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree at most 3, then planar H-COL is NP-complete
AbstractWe show that if H is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree at most 3, then planar H-COL is NP-complete
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
A colouring of a graphGVE=( ,)is a function→cV:{1, 2,...}such that≠cucv() ()for every∈uvE.Ak‐regular...
AbstractWe show that if H is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree ...
AbstractWe investigate the complexity of the H-colouring problem restricted to graphs of bounded deg...
We investigate the complexity of the h-colouring problem, and, more generally, of the H-colouring pr...
AbstractLet H be a graph (respectively digraph) whose vertices are called ‘colours’. An H-colouring ...
AbstractLet H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph...
AbstractGiven a graph H, let b(H) be the minimum integer b, if it exists, for which H-colouring is N...
AbstractA graph G is k-choosable if for every assignment of a set S(v) of k colors to every vertex v...
An HV-graph is a planar graph with vertex-degree at most four such that each edge is labeled either ...
AbstractIt is shown that two sorts of problems belong to the NP-complete class. First, it is proven ...
AbstractLet H be a fixed undirected graph. An H-colouring of an undirected graph G is a homomorphism...
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polyn...
Graphs are a very flexible tool within mathematics, as such, numerous problems can be solved by form...
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
A colouring of a graphGVE=( ,)is a function→cV:{1, 2,...}such that≠cucv() ()for every∈uvE.Ak‐regular...
AbstractWe show that if H is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree ...
AbstractWe investigate the complexity of the H-colouring problem restricted to graphs of bounded deg...
We investigate the complexity of the h-colouring problem, and, more generally, of the H-colouring pr...
AbstractLet H be a graph (respectively digraph) whose vertices are called ‘colours’. An H-colouring ...
AbstractLet H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph...
AbstractGiven a graph H, let b(H) be the minimum integer b, if it exists, for which H-colouring is N...
AbstractA graph G is k-choosable if for every assignment of a set S(v) of k colors to every vertex v...
An HV-graph is a planar graph with vertex-degree at most four such that each edge is labeled either ...
AbstractIt is shown that two sorts of problems belong to the NP-complete class. First, it is proven ...
AbstractLet H be a fixed undirected graph. An H-colouring of an undirected graph G is a homomorphism...
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polyn...
Graphs are a very flexible tool within mathematics, as such, numerous problems can be solved by form...
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
We consider the problem of coloring a planar graph with the minimum number of colors so that each co...
A colouring of a graphGVE=( ,)is a function→cV:{1, 2,...}such that≠cucv() ()for every∈uvE.Ak‐regular...
Add to ORKG