Morteza Hasanvand

collaborators

6 papers

math.CO2025

On the existence of minimally tough graphs having large minimum degrees

Morteza Hasanvand

Kriesel conjectured that every minimally $1$ -tough graph has a vertex with degree precisely $2$ . Katona and Varga (2018) proposed a generalized version of this conjecture which say…

math.CO2025

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

Morteza Hasanvand

Kostochka and Woodall (2001) conjectured that the square of every graph has the same chromatic number and list chromatic number. In 2015 Kim and Park disproved this conjecture for…

math.CO2024

Edge-decompositions of $O (m)$ -edge-connected graphs into isomorphic copies of a fixed tree of size $m$

Morteza Hasanvand

In this paper, we show that every $O (m)$ -edge-connected simple graph $G$ of size divisible by $m$ with minimum degree at least $2^{O (m)}$ has an edge-decomposition into isomorphic…

math.CO2024

Equitable factorizations of highly edge-connected graphs: complete characterizations

Morteza Hasanvand

In this paper, we show that every highly edge-connected graph $G$ , under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_{1}, \dots, G_{k}$ such…

math.CO2024

Modulo factors with bounded degrees

Morteza Hasanvand

Let $G$ be a bipartite graph with bipartition $(X, Y)$ , let $k$ be a positive integer, and let $f : V (G) \to {- 1, \dots, k - 2}$ be a mapping with $\sum_{v\in X}f(v) \stackrel{…

math.CO2024

Spanning tree-connected subgraphs with small degrees

Morteza Hasanvand

Let $G$ be a graph with a spanning subgraph $F$ , let $m$ be a positive integer, and let $f$ be a positive integer-valued function on $V (G)$ . In this paper, we show that if for all…

On the existence of minimally tough graphs having large minimum degrees

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

Edge-decompositions of O(m)-edge-connected graphs into isomorphic copies of a fixed tree of size m

Equitable factorizations of highly edge-connected graphs: complete characterizations

Modulo factors with bounded degrees

Spanning tree-connected subgraphs with small degrees

Edge-decompositions of $O (m)$ -edge-connected graphs into isomorphic copies of a fixed tree of size $m$