In this paper, we reduce the maximum weighted matching problem to the la...
In the classical partial vertex cover problem, we are given a graph G an...
If f:ℕ→ℕ is a function, then let us say that
f is sublinear if
lim_...
An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...
A function f:N→ N is sublinear, if
lim_x→
+∞f(x)/x=0.
If A is ...
An equitable coloring of a graph G is a proper vertex coloring of G such...
In the weighted partial vertex cover problem (WPVC), we are given a grap...
In the Maximum Connectivity Improvement (MCI) problem, we are given a
di...
A k-edge-coloring of a graph is an assignment of colors {1,...,k} to
edg...
In a proper edge-coloring of a cubic graph an edge uv is called poor or
...
In an edge-coloring of a cubic graph, an edge is poor or rich, if the se...
If G and H are two cubic graphs, then an H-coloring of G is a proper
edg...
A clutter (or antichain or Sperner family) L is a pair
(V,E), where V...
If k≥ 0, then a k-edge-coloring of a graph G is an assignment of
colors ...
A normal k-edge-coloring of a cubic graph is an edge-coloring with k
col...