Morteza Hasanvand

activity

20162025

most citedThe List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs

2 citations · 4 across the 22 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Equitable factorizations of edge-connected graphs

Morteza Hasanvand

In this paper, we show that every $(3 k - 3)$ -edge-connected graph $G$ , under a certain condition on whose degrees, can be edge-decomposed into $k$ factors $G_{1}, \dots, G_{k}$ such that…

math.CO2019

Bipartite partition-connected factors with small degrees

Morteza Hasanvand

In this paper, we show that every $2 m$ -partition-connected graph $G$ has a bipartite $m$ -partition-connected factor $H$ such that for each vertex $v$ , $d_H(v)\le \lceil \frac{3}{4}…