Moharram N. Iradmusa

collaborators

2 papers

math.CO2008

On Coloring of graph fractional powers

Moharram N. Iradmusa

\noindent Let $G$ be a simple graph. For any $k \in N$ , the $k -$ power of $G$ is a simple graph $G^{k}$ with vertex set $V (G)$ and edge set ${x y : d_{G} (x, y) \leq k}$ and the $k -$ subdivis…

math.CO2008

A Note on Partial List Colorings

Moharram Iradmusa

Let $G$ be a simple graph with $n$ vertices and list chromatic number $χ_{ℓ} (G) = χ_{ℓ}$ . Suppose that $0 \leq t \leq χ_{ℓ}$ and each vertex of $G$ is assigned a list of $t$ colors.…