List of computer science publications by F. Khaghanpoor.

Mar 3, 2015 · ~Akbari, F.~Khaghanpoor, and S.~Moazzeni, cited in [P.J. Cameron, Research problems from the BCC22, \emph{Discrete Math.} {\bf 311} (2011) ...

It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni stating that every connected graph G other than C 7 admits a χ ( G ) - ...

Apr 14, 2011 · Abstract. It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs.

Jun 1, 2017 · Akbari, F. Khaghanpoor, and S. Moazzeni, Colorful paths in vertex coloring of graphs, preprint. [2] S. Akbari, V. Liaghat, and A. Nikzad ...

... F. Khaghanpoor, S. Moazzeni, Colorful paths in vertex coloring of graphs,. submitted. [2] J.A. Bondy, U.S.R. Murty, Graph Theory, Graduate Texts in ...

Mar 3, 2011 · Abstract. It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs.

It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs. Preprint] that, if G is a connected graph ...

Akbari, F. Khaghanpoor and S. Moazzeni raised in [1] (cited also in [5]). Conjecture 1 (S. Akbari, F. Khaghanpoor and S. Moazzeni [1]). Every connected ...

Research interests: Combinatorics: Graph Coloring, Probabilistic Methods in Combinatorics, Algebraic Combinatorics, Topological Combinatorics and Their ...