Add to ORKGGiven a graph G = (V,E) and a weight function w: E → R, a coloring of vertices of G, induced by w, is defined by χw(v) = e3v w(e) for all v ∈ V. In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP-complete.
Let us assign positive integers to the edges and vertices of a simple graphG. As a result we obtain ...
An edge-weighting vertex colouring of a graph is an edge-weight assignment such that the accumulated...
AbstractWe study the minimum number of weights assigned to the edges of a graph G with no component ...
AbstractA weighting of the edges of a graph is called vertex-coloring if the weighted degrees of the...
Abstract. A weighting of the edges of a graph is called vertex-coloring if the weighted degrees of t...
A k-edge-weighting of a graph G is a function w: E(G) → {1, 2,..., k}. An edge-weighting naturally i...
Given a vertex-weighted graph G = (V,E;w), w(v) ≥ 0 for any v ∈ V, we consider a weighted version o...
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of...
Abstract. A weighting of the edges of a graph is called neighbor distinguishing if the weighted degr...
AbstractCan the edges of any non-trivial graph be assigned weights from {1,2,3} so that adjacent ver...
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring pr...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
approximability results Bruno Escoffier∗, Jérôme Monnot∗, Vangelis Th. Paschos∗ Given a vertex-weigh...
International audienceA proper coloring of a graph is a partition of its vertex set into stable sets...
Let us assign positive integers to the edges and vertices of a simple graphG. As a result we obtain ...
An edge-weighting vertex colouring of a graph is an edge-weight assignment such that the accumulated...
AbstractWe study the minimum number of weights assigned to the edges of a graph G with no component ...
AbstractA weighting of the edges of a graph is called vertex-coloring if the weighted degrees of the...
Abstract. A weighting of the edges of a graph is called vertex-coloring if the weighted degrees of t...
A k-edge-weighting of a graph G is a function w: E(G) → {1, 2,..., k}. An edge-weighting naturally i...
Given a vertex-weighted graph G = (V,E;w), w(v) ≥ 0 for any v ∈ V, we consider a weighted version o...
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of...
Abstract. A weighting of the edges of a graph is called neighbor distinguishing if the weighted degr...
AbstractCan the edges of any non-trivial graph be assigned weights from {1,2,3} so that adjacent ver...
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring pr...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
approximability results Bruno Escoffier∗, Jérôme Monnot∗, Vangelis Th. Paschos∗ Given a vertex-weigh...
International audienceA proper coloring of a graph is a partition of its vertex set into stable sets...
Let us assign positive integers to the edges and vertices of a simple graphG. As a result we obtain ...
An edge-weighting vertex colouring of a graph is an edge-weight assignment such that the accumulated...
AbstractWe study the minimum number of weights assigned to the edges of a graph G with no component ...