2 citations · 3 across the 15 of their papers we have counts for
10 papers · 1 filter
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…
The existence of tree-connected -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 in a graph such that for each vertex , , where and $…
Toughness and the existence of tree-connected -factors
Morteza Hasanvand
Let be a graph and let be a positive integer-valued function on satisfying , where and are two positive integers with . In this pape…
Highly tree-connected complementary modulo factors with bounded degrees
Morteza Hasanvand
Let be a bipartite graph with bipartition , let be a positive integer, and let be a mapping with $\sum_{v\in X}f(v) \stackrel{k}{\equiv}\sum_…
The existence of planar -connected essentially -edge-connected graphs with no claw-decompositions
Morteza Hasanvand
In 2006 Bar{á}t and Thomassen conjectured that every planar -edge-connected -regular simple graph of size divisible by three admits a claw-decomposition. Later, Lai (2007) di…
The existence of -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 such that for each vertex , the out-degree…