Add to ORKGIn this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention to the subclasses of oriented prisms, Halin and cacti
Suppose that T is a plane tree without vertices of degree 2 and with at least one vertex of at least...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attent...
The L(2, 1)-labeling of a digraph D is a function l from the vertex set of D to the set of all nonne...
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-spa...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
An L(2, 1)-labeling of a graph is a mapping c: V (G) → {0,..., K} such that the labels assigned to ...
L(h, 1)-labeling, h = 0, 1, 2, is a class of coloring problems arising from frequency assignment in ...
The L(2, 1)-labeling of a digraph G is a function f from the node set of G to the set of all non-neg...
An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, ⋯, λ} to t...
The L(2, 1)-labeling of a graph G is a mapping f : (V(G) → Z* such that | f(u) - f(v) | ≥ 2 if d(u, ...
Tato práce se zabývá L(2,1)-ohodnocením grafů a zkoumá horní a dolní mez pro číslo lambda(2,1). Prác...
International audienceA mapping from the vertex set of a graph $G=(V,E)$ into an interval of integer...
International audienceA graph is planar if it can be embedded on the plane without edge-crossing. A ...
Suppose that T is a plane tree without vertices of degree 2 and with at least one vertex of at least...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...
In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attent...
The L(2, 1)-labeling of a digraph D is a function l from the vertex set of D to the set of all nonne...
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-spa...
AbstractAn L(2,1)-labeling of a graph is a mapping c:V(G)→{0,…,K} such that the labels assigned to n...
An L(2, 1)-labeling of a graph is a mapping c: V (G) → {0,..., K} such that the labels assigned to ...
L(h, 1)-labeling, h = 0, 1, 2, is a class of coloring problems arising from frequency assignment in ...
The L(2, 1)-labeling of a digraph G is a function f from the node set of G to the set of all non-neg...
An L(h, 1, 1)-labeling of a graph is an assignment of labels from the set of integers {0, ⋯, λ} to t...
The L(2, 1)-labeling of a graph G is a mapping f : (V(G) → Z* such that | f(u) - f(v) | ≥ 2 if d(u, ...
Tato práce se zabývá L(2,1)-ohodnocením grafů a zkoumá horní a dolní mez pro číslo lambda(2,1). Prác...
International audienceA mapping from the vertex set of a graph $G=(V,E)$ into an interval of integer...
International audienceA graph is planar if it can be embedded on the plane without edge-crossing. A ...
Suppose that T is a plane tree without vertices of degree 2 and with at least one vertex of at least...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractA k-L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,…,k} such ...