Add to ORKGWe study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to assign vertices of a graph labels from the set {0, . . . , λ} such that labels of adjacent vertices differ by at least p while vertices with a common neighbor have different labels. We use two different reductions, one from the NAE-3SAT and the second one from the edge precoloring extension problem.
AbstractWe study the parameterized complexity of several minimum label graph problems, in which we a...
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤...
Tato diplomová práce se zabývá L(p,q)-ohodnocením grafů a L(p,q,r)-ohodnocením grafů. Příslušným oho...
We study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to ass...
AbstractA λ-labeling of a graph G is an assignment of labels from the set {0,…,λ} to the vertices of...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, ...
The L(p, q)-Edge-Labelling problem is the edge variant of the well-known L(p, q)-Labelling problem....
AbstractGiven a simple graph G, by an L(p,q)-labeling of G we mean a function c that assigns nonnega...
Given an undirected graph G, an L(h, k)-labelling of G assigns colors to vertices from the integer s...
This thesis consists of three parts devoted to graph labeling, hereditary graph classes, and paramet...
AbstractA labelling of a simple graph G=(V,E) is an assignment f of integers to the vertices of G. U...
We study the parameterized complexity of several minimum label graph problems, in which we are given...
A labelling of a simple graph G = (V,E) is an assignment f of integers to the vertices of G. Under s...
In this paper, we address the problem of λ labelings, that was introduced in the context of frequenc...
Given two non negative integers h and k, an L(h,k)-labeling of a graph G=(V,E) is a map from V to a ...
AbstractWe study the parameterized complexity of several minimum label graph problems, in which we a...
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤...
Tato diplomová práce se zabývá L(p,q)-ohodnocením grafů a L(p,q,r)-ohodnocením grafů. Příslušným oho...
We study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to ass...
AbstractA λ-labeling of a graph G is an assignment of labels from the set {0,…,λ} to the vertices of...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, ...
The L(p, q)-Edge-Labelling problem is the edge variant of the well-known L(p, q)-Labelling problem....
AbstractGiven a simple graph G, by an L(p,q)-labeling of G we mean a function c that assigns nonnega...
Given an undirected graph G, an L(h, k)-labelling of G assigns colors to vertices from the integer s...
This thesis consists of three parts devoted to graph labeling, hereditary graph classes, and paramet...
AbstractA labelling of a simple graph G=(V,E) is an assignment f of integers to the vertices of G. U...
We study the parameterized complexity of several minimum label graph problems, in which we are given...
A labelling of a simple graph G = (V,E) is an assignment f of integers to the vertices of G. Under s...
In this paper, we address the problem of λ labelings, that was introduced in the context of frequenc...
Given two non negative integers h and k, an L(h,k)-labeling of a graph G=(V,E) is a map from V to a ...
AbstractWe study the parameterized complexity of several minimum label graph problems, in which we a...
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤...
Tato diplomová práce se zabývá L(p,q)-ohodnocením grafů a L(p,q,r)-ohodnocením grafů. Příslušným oho...