#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2009

2017

- This year (4)
- Last 5 years (8)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Meysam Alishahi, Hossein Hajiabolhassan
- J. Comb. Theory, Ser. B
- 2015

- Meysam Alishahi, Ali Taherkhani, Carsten Thomassen
- Electr. J. Comb.
- 2011

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 distinct from C7, then there is a χ(G)-coloring of G in which every vertex v ∈ V (G) is an initial vertex of a path P with χ(G) vertices whose colors are different. In [S. Akbari, V. Liaghat, and A.… (More)

- Meysam Alishahi
- Discrete Applied Mathematics
- 2012

- Meysam Alishahi
- Discrete Applied Mathematics
- 2011

Let G be a graph. A proper vertex coloring of G is said to be a dynamic coloring if for every v ∈ V (G) of degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic k-coloring is called the dynamic chromatic number of G and is denoted by χ2(G). It was conjectured that if G is an r-regular… (More)

- Meysam Alishahi
- 2009

A dynamic coloring of a graph G is a proper coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. In this paper we present some upper bounds for the dynamic chromatic number of graphs. In this regard, we shall show that there is a constant c such that for every k-regular graph G, χd(G) ≤ χ(G) + c… (More)

- Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier
- Eur. J. Comb.
- 2017

- Meysam Alishahi, Frédéric Meunier
- Electr. J. Comb.
- 2017

This paper deals with two problems about splitting fairly a path with colored vertices, where “fairly” means that each part contains almost the same amount of vertices in each color. Our first result states that it is possible to remove one vertex per color from a path with colored vertices so that the remaining vertices can be fairly split into two… (More)

- Meysam Alishahi
- Electr. J. Comb.
- 2017

There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Electron. J. Combin., 2014] presented the first colorful type result for uniform hypergraphs. In… (More)

In an earlier paper, the present authors (2013) [1] introduced the alternating chromatic number for hypergraphs and used Tucker’s Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the alternating chromatic number is a lower bound for the chromatic number. In this paper, we determine the chromatic number of some families of… (More)

- Meysam Alishahi, Hossein Hajiabolhassan
- Discrete Mathematics
- 2017