VMVahan Mkrtchyan
Vahan Mkrtchyan
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Vahan Mkrtchyan has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- K. Subramani
West Virginia University
8 shared publications - Giuseppe Mazzuoccolo
Dipartimento di Scienze Fisiche, Informatiche e Matematiche Università di Modena e Reggio Emilia Modena Italy
6 shared publications - Hanna Furmańczyk
Institute of Informatics Faculty of Mathematics Physics and Informatics University of Gdańsk Gdańsk Poland
6 shared publications - Gagik N. Vardanyan
Department of Informatics and Applied Mathematics Yerevan State University 0025 Yerevan Armenia
4 shared publications - Garik Petrosyan
Department of Informatics and Applied Mathematics, Yerevan State University, Yerevan, Armenia
3 shared publications K. Subramani
West Virginia University
3 shared publications
Latest Publications
- 13 February 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 385, 178-193
Block graphs — Some general results and their equitable colorings
- 13 February 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 385, 178-193
Block graphs — Some general results and their equitable colorings
- Open Access
Expanding vertices to triangles in cubic graphs
Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain vertices of cubic graphs are expanded into triangles to achieve a desired property. We first focus on bridgeless cubic graphs and define the parameter $T(G)$ as the minimum number of vertices that need to be expanded into triangles so that the resulting cubic graph can be covered with four perfect matchings. We relate this parameter to the concept of shortest cycle cover. Furthermore, we show that if $5$-Cycle Double Cover Conejcture holds true, then $T(G)\leq \frac{2}{5} |V(G)|$. We conjecture a tighter bound, $T(G)\leq \frac{1}{10}|V(G)|$, which is optimal for the Petersen graph, and show that this bound follows from major conjectures like the Petersen Coloring Conjecture. In the second part of the paper, we introduce the parameter $t(G)$ as the minimum number of vertex expansions needed for the graph to admit a perfect matching. We prove a Gallai type identity: $t(G)+\ell(G)=|V(G)|$, where $\ell(G)$ is the number of edges in a largest even subgraph of $G$. Then we prove the general upper bound $t(G)< \frac{1}{4}|V(G)|$ for cubic graphs, and $t(G)< \frac{1}{6}|V(G)|$ for cubic graphs without parallel edges. We provide examples showing that these bounds are asymptotically tight. The paper concludes with a discussion of the computational complexity of determining these parameters.Open AccessExpanding vertices to triangles in cubic graphs
Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain vertices of cubic graphs are expanded into triangles to achieve a desired property. We first focus on bridgeless cubic graphs and define the parameter $T(G)$ as the minimum number of vertices that need to be expanded into triangles so that the resulting cubic graph can be covered with four perfect matchings. We relate this parameter to the concept of shortest cycle cover. Furthermore, we show that if $5$-Cycle Double Cover Conejcture holds true, then $T(G)\leq \frac{2}{5} |V(G)|$. We conjecture a tighter bound, $T(G)\leq \frac{1}{10}|V(G)|$, which is optimal for the Petersen graph, and show that this bound follows from major conjectures like the Petersen Coloring Conjecture. In the second part of the paper, we introduce the parameter $t(G)$ as the minimum number of vertex expansions needed for the graph to admit a perfect matching. We prove a Gallai type identity: $t(G)+\ell(G)=|V(G)|$, where $\ell(G)$ is the number of edges in a largest even subgraph of $G$. Then we prove the general upper bound $t(G)< \frac{1}{4}|V(G)|$ for cubic graphs, and $t(G)< \frac{1}{6}|V(G)|$ for cubic graphs without parallel edges. We provide examples showing that these bounds are asymptotically tight. The paper concludes with a discussion of the computational complexity of determining these parameters. - 12 April 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 371, 127-136
Three results towards approximation of special maximum matchings in graphs
- 12 April 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 371, 127-136
Three results towards approximation of special maximum matchings in graphs
- Open AccessNon-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphsLet $Z_2\times Z_2=\{0, α, β, α+β\}$. If $G$ is a bridgeless cubic graph, $F$ is a perfect matching of $G$ and $\overline{F}$ is the complementary 2-factor of $F$, then a no-where zero $Z_2\times Z_2$-flow $θ$ of $G/\overline{F}$ is called non-conflicting with respect to $\overline{F}$, if $\overline{F}$ contains no edge $e=uv$, such that $u$ is incident to an edge with $θ$-value $α$ and $v$ is incident to an edge with $θ$-value $β$. In this paper, we demonstrate the usefulness of non-conflicting flows by showing that if a cubic graph $G$ admits such a flow with respect to some perfect matching $F$, then $G$ admits a normal 6-edge-coloring. We use this observation in order to show that claw-free bridgeless cubic graphs, bridgeless cubic graphs possessing a 2-factor having at most two cycles admit a normal 6-edge-coloring. We demonstrate the usefulness of non-conflicting flows further by relating them to a recent conjecture of Thomassen about edge-disjoint perfect matchings in highly connected regular graphs. In the end of the paper, we construct infinitely many 2-edge-connected cubic graphs such that $G/\overline{F}$ does not admit a non-conflicting no-where zero $Z_2\times Z_2$-flow with respect to any perfect matching $F$.Open AccessNon-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphsLet $Z_2\times Z_2=\{0, α, β, α+β\}$. If $G$ is a bridgeless cubic graph, $F$ is a perfect matching of $G$ and $\overline{F}$ is the complementary 2-factor of $F$, then a no-where zero $Z_2\times Z_2$-flow $θ$ of $G/\overline{F}$ is called non-conflicting with respect to $\overline{F}$, if $\overline{F}$ contains no edge $e=uv$, such that $u$ is incident to an edge with $θ$-value $α$ and $v$ is incident to an edge with $θ$-value $β$. In this paper, we demonstrate the usefulness of non-conflicting flows by showing that if a cubic graph $G$ admits such a flow with respect to some perfect matching $F$, then $G$ admits a normal 6-edge-coloring. We use this observation in order to show that claw-free bridgeless cubic graphs, bridgeless cubic graphs possessing a 2-factor having at most two cycles admit a normal 6-edge-coloring. We demonstrate the usefulness of non-conflicting flows further by relating them to a recent conjecture of Thomassen about edge-disjoint perfect matchings in highly connected regular graphs. In the end of the paper, we construct infinitely many 2-edge-connected cubic graphs such that $G/\overline{F}$ does not admit a non-conflicting no-where zero $Z_2\times Z_2$-flow with respect to any perfect matching $F$.
- Open Access
Block graphs - some general results and their equitable colorings
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We also give complete characterization of block graphs with given value of parameter $α_{\min}$. In the next part of the paper we confirm the hypothesis for some subclass of GLS block graphs in which the problem of EQUITABLE COLORING is unlikely to be polynomial time solvable. We give also an equitable $(n+2)$-algorithm for all GLS block graphs. As a by product we prove that the equitable chromatic spectrum for the subclass of GLS block graphs is gap-free.Open AccessBlock graphs - some general results and their equitable colorings
In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We also give complete characterization of block graphs with given value of parameter $α_{\min}$. In the next part of the paper we confirm the hypothesis for some subclass of GLS block graphs in which the problem of EQUITABLE COLORING is unlikely to be polynomial time solvable. We give also an equitable $(n+2)$-algorithm for all GLS block graphs. As a by product we prove that the equitable chromatic spectrum for the subclass of GLS block graphs is gap-free. - 1 December 2023
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (1) , 122-143
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
- 1 December 2023
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (1) , 122-143
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
- Open Access
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 354, 15-28
Gap one bounds for the equitable chromatic number of block graphs
- 7 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 354, 15-28
Open AccessGap one bounds for the equitable chromatic number of block graphs
- Open Access
- 30 November 2022
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. 23 no. 2, (Special s)
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) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem.- 30 November 2022
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. 23 no. 2, (Special s)
Open AccessGraph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem. - Open Access
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) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem.Open AccessGraph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem. - Open Access
Assigning tasks to agents under time conflicts: a parameterized complexity approach
We consider the problem of assigning tasks to agents under time conflicts, with applications also to frequency allocations in point-to-point wireless networks. In particular, we are given a set $V$ of $n$ agents, a set $E$ of $m$ tasks, and $k$ different time slots. Each task can be carried out in one of the $k$ predefined time slots, and can be represented by the subset $e\subseteq E$ of the involved agents. Since each agent cannot participate to more than one task simultaneously, we must find an allocation that assigns non-overlapping tasks to each time slot. Being the number of slots limited by $k$, in general it is not possible to executed all the possible tasks, and our aim is to determine a solution maximizing the overall social welfare, that is the number of executed tasks. We focus on the restriction of this problem in which the number of time slots is fixed to be $k=2$, and each task is performed by exactly two agents, that is $|e|=2$. In fact, even under this assumptions, the problem is still challenging, as it remains computationally difficult. We provide parameterized complexity results with respect to several reasonable parameters, showing for the different cases that the problem is fixed-parameter tractable or it is paraNP-hard.Open AccessAssigning tasks to agents under time conflicts: a parameterized complexity approach
We consider the problem of assigning tasks to agents under time conflicts, with applications also to frequency allocations in point-to-point wireless networks. In particular, we are given a set $V$ of $n$ agents, a set $E$ of $m$ tasks, and $k$ different time slots. Each task can be carried out in one of the $k$ predefined time slots, and can be represented by the subset $e\subseteq E$ of the involved agents. Since each agent cannot participate to more than one task simultaneously, we must find an allocation that assigns non-overlapping tasks to each time slot. Being the number of slots limited by $k$, in general it is not possible to executed all the possible tasks, and our aim is to determine a solution maximizing the overall social welfare, that is the number of executed tasks. We focus on the restriction of this problem in which the number of time slots is fixed to be $k=2$, and each task is performed by exactly two agents, that is $|e|=2$. In fact, even under this assumptions, the problem is still challenging, as it remains computationally difficult. We provide parameterized complexity results with respect to several reasonable parameters, showing for the different cases that the problem is fixed-parameter tractable or it is paraNP-hard.