AbstractGiven a finite set T of positive integers, with 0 ϵ T, a T-coloring of a graph G = (V, E) is a function f: V → N0 such that for each {x, y} ϵE|f(x) − f(y)|∉T. The T-span is the difference between the largest and smallest colors and the T-span of G is the minimum span over all T-colorings of G. We show that the problem to find the T-span for a complete graph is NP-complete
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
AbstractFix a finite interference set T of nonnegative integers, 0 ϵ T. A T-coloring of a simple gra...
AbstractGiven a finite set T of positive integers, with 0 ϵ T, a T-coloring of a graph G = (V, E) is...
AbstractGiven a finite set T of positive integers containing {0};, a T-coloring of a simple graph G ...
Abstract. Suppose G is a graph and T is a set of non-negative integers that contains 0. A T-coloring...
AbstractLet G be the collection of sets T such that the greedy algorithm obtains the optimal T-span ...
AbstractGiven a finite set T of positive integers containing {0};, a T-coloring of a simple graph G ...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
AbstractIn the paper we consider a generalized vertex coloring model, namely T-coloring. For a given...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractThe T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers contain...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
AbstractFix a finite interference set T of nonnegative integers, 0 ϵ T. A T-coloring of a simple gra...
AbstractGiven a finite set T of positive integers, with 0 ϵ T, a T-coloring of a graph G = (V, E) is...
AbstractGiven a finite set T of positive integers containing {0};, a T-coloring of a simple graph G ...
Abstract. Suppose G is a graph and T is a set of non-negative integers that contains 0. A T-coloring...
AbstractLet G be the collection of sets T such that the greedy algorithm obtains the optimal T-span ...
AbstractGiven a finite set T of positive integers containing {0};, a T-coloring of a simple graph G ...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
AbstractIn the paper we consider a generalized vertex coloring model, namely T-coloring. For a given...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
AbstractT-colorings arose from the channel assignment problem in communications. Given a finite set ...
AbstractThe T-coloring problem is, given a graph G = (V, E), a set T of nonnegative integers contain...
AbstractThis paper deals with greedy T-colorings of graphs, i.e. T-colorings produced by the greedy ...
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
[[abstract]]Given a nonnegative integer r, a no-hole (r + 1)-distant coloring, called N-r-coloring, ...
AbstractFix a finite interference set T of nonnegative integers, 0 ϵ T. A T-coloring of a simple gra...
DOI
Add to ORKG