Morteza Hasanvand

collaborators

7 papers

math.CO2022

The existence of tree-connected ${g, f}$ -factors in edge-connected graphs and tough graphs

Morteza Hasanvand

In 1970 Lov{á}sz gave a necessary and sufficient condition for the existence of a factor $F$ in a graph $G$ such that for each vertex $v$ , $g (v) \leq d_{F} (v) \leq f (v)$ , where $g$ and $…

math.CO2022

A necessary and sufficient condition for the existence of ${p, p + 1, q - 1, q}$ -orientations in simple graphs

Morteza Hasanvand

Let $G$ be a simple graph and let $p$ and $q$ be two integer-valued functions on $V (G)$ with $p < q$ in which for each $v \in V (G)$ , $q (v) \geq \frac{1}{2} d_{G} (v)$ and $p(v) \ge \frac{…

math.CO2022

Toughness and the existence of tree-connected ${f, f + k}$ -factors

Morteza Hasanvand

Let $G$ be a graph and let $f$ be a positive integer-valued function on $V (G)$ satisfying $2 m \leq f \leq b$ , where $b$ and $m$ are two positive integers with $b \geq 4 m^{2}$ . In this pape…

math.CO2022

Highly tree-connected complementary 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 Z_{k}$ be a mapping with $\sum_{v\in X}f(v) \stackrel{k}{\equiv}\sum_…

math.CO2022

The existence of planar $4$ -connected essentially $6$ -edge-connected graphs with no claw-decompositions

Morteza Hasanvand

In 2006 Bar{á}t and Thomassen conjectured that every planar $4$ -edge-connected $4$ -regular simple graph of size divisible by three admits a claw-decomposition. Later, Lai (2007) di…

math.CO2022

The existence of ${p, q}$ -orientations in edge-connected graphs

Morteza Hasanvand

In 1976 Frank and Gy{á}rf{á}s gave a necessary and sufficient condition for the existence of an orientation in an arbitrary graph $G$ such that for each vertex $v$ , the out-degree…

The existence of tree-connected {g,f}-factors in edge-connected graphs and tough graphs

A necessary and sufficient condition for the existence of {p,p+1,q−1,q}-orientations in simple graphs

Toughness and the existence of tree-connected {f,f+k}-factors

Highly tree-connected complementary modulo factors with bounded degrees

The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions

The existence of {p,q}-orientations in edge-connected graphs

The existence of tree-connected ${g, f}$ -factors in edge-connected graphs and tough graphs

A necessary and sufficient condition for the existence of ${p, p + 1, q - 1, q}$ -orientations in simple graphs

Toughness and the existence of tree-connected ${f, f + k}$ -factors

The existence of planar $4$ -connected essentially $6$ -edge-connected graphs with no claw-decompositions

The existence of ${p, q}$ -orientations in edge-connected graphs