N. Haghparast

collaborators

2 papers

math.CO2021

The existence of uniform hypergraphs for which interpolation property of complete coloring fails

Nastaran Haghparast, Morteza Hasanvand, Yumiko Ohno

In 1967 Harary, Hedetniemi, and Prins showed that every graph $G$ admits a complete $t$ -coloring for every $t$ with $χ (G) \leq t \leq ψ (G)$ , where $χ (G)$ denotes the chromatic number…

math.CO2019

Catlin's conjecture and maximum eulerian subgraph

Nastaran Haghparast

A graph $G = (V (G), E (G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $ℓ (G)$ be the maximum number of edges of spanning Eulerian subgraphs of a supereulerian gra…