20 citations · 146 across the 41 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
Vahan Mkrtchyan, Garik Petrosyan
In the classical partial vertex cover problem, we are given a graph and two positive integers and . The goal is to check whether there is a subset of of size at…
cs.DM2021
On sublinear approximations for the Petersen coloring conjecture
Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
If is a function, then let us say that is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If is a cubic graph and $…