
On the fixedparameter tractability of the partial vertex cover problem with a matching constraint in edgeweighted bipartite graphs
In the classical partial vertex cover problem, we are given a graph G an...
read it

On sublinear approximations for the Petersen coloring conjecture
If f:ℕ→ℕ is a function, then let us say that f is sublinear if lim_...
read it

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
An equitable coloring of a graph G=(V,E) is a (proper) vertexcoloring o...
read it

Sublinear bounds for nullity of flows and approximating Tutte's flow conjectures
A function f:N→ N is sublinear, if lim_x→ +∞f(x)/x=0. If A is ...
read it

VizingGoldberg type bounds for the equitable chromatic number of block graphs
An equitable coloring of a graph G is a proper vertex coloring of G such...
read it

Parameterized algorithms for Partial vertex covers in bipartite graphs
In the weighted partial vertex cover problem (WPVC), we are given a grap...
read it

On the fixedparameter tractability of the maximum connectivity improvement problem
In the Maximum Connectivity Improvement (MCI) problem, we are given a di...
read it

On the fixedparameter tractability of the maximum 2edgecolorable subgraph problem
A kedgecoloring of a graph is an assignment of colors {1,...,k} to edg...
read it

Normal 5edgecolorings of a family of Loupekhine snarks
In a proper edgecoloring of a cubic graph an edge uv is called poor or ...
read it

Normal 6edgecolorings of some bridgeless cubic graphs
In an edgecoloring of a cubic graph, an edge is poor or rich, if the se...
read it

S_12 and P_12colorings of cubic graphs
If G and H are two cubic graphs, then an Hcoloring of G is a proper edg...
read it

A tight lower bound for the hardness of clutters
A clutter (or antichain or Sperner family) L is a pair (V,E), where V...
read it

On maximum kedgecolorable subgraphs of bipartite graphs
If k≥ 0, then a kedgecoloring of a graph G is an assignment of colors ...
read it

Normal edgecolorings of cubic graphs
A normal kedgecoloring of a cubic graph is an edgecoloring with k col...
read it
Vahan Mkrtchyan
is this you? claim profile