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

3 papers · 1 filter

math.CO2017★ 1 cited

Spanning closed walks with bounded maximum degrees of graphs on surfaces

Morteza Hasanvand

Gao and Richter (1994) showed that every $3$ -connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most $2$ times. Bru…

math.CO2017

Modulo orientations with bounded out-degrees

Morteza Hasanvand

Let $G$ be a graph, let $k$ be a positive integer, and let $p : V (G) \to Z_{k}$ be a mapping with $∣ E (G) ∣ \equiv k \sum_{v \in V (G)} p (v)$ . In this paper, we show that…

math.CO2017

Spanning trees and spanning closed walks with small degrees

Morteza Hasanvand

Let $G$ be a graph and let $f$ be a positive integer-valued function on $V (G)$ . In this paper, we show that if for all $S \subseteq V (G)$ , $ω(G\setminus S)<\sum_{v\in S}(f(v)-2)+2+ω…