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 2018Show all

3 papers · 1 filter

math.CO2018

Factors and connected factors in tough graphs with high isolated toughness

Morteza Hasanvand

Let $G$ be a graph and let $f$ be a positive integer-valued function on $V (G)$ . Assume that for all $S \subseteq V (G)$ , $v \in I (G ∖ S) \sum f (v) (f (v) + 1) \leq ∣ S ∣,$ where $I(…

math.CO2018

Packing spanning rigid subgraphs with restricted degrees

Morteza Hasanvand

Let $G$ be a graph and let $l$ be an integer-valued function on subsets of $V (G)$ . The graph $G$ is said to be $l$ -partition-connected, if for every partition $P$ of $V (G)$ , $e_G(P…

math.CO2018★ 1 cited

Packing spanning partition-connected subgraphs with small degrees

Morteza Hasanvand

Let $G$ be a graph with $X \subseteq V (G)$ and let $l$ be an intersecting supermodular subadditive integer-valued function on subsets of $V (G)$ . The graph $G$ is said to be $l$ -part…