|
Search the dblp DataBase
Behnaz Omoomi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah
Smallest defining number of r-regular k-chromatic graphs: r 1 k. [Citation Graph (0, 0)][DBLP] Ars Comb., 2006, v:78, n:, pp:- [Journal]
- Behnaz Omoomi, Yee-Hock Peng
Chromatic Equivalence Classes of Certain Generalized Polygon Trees, II. [Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:68, n:, pp:- [Journal]
- Behnaz Omoomi, Yee-Hock Peng
Chromatic equivalence classes of certain cycles with edges. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:232, n:1-3, pp:175-183 [Journal]
- Behnaz Omoomi, Yee-Hock Peng
Chromatic equivalence classes of certain generalized polygon trees, III. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:271, n:1-3, pp:223-234 [Journal]
A note on the P-time algorithms for solving the maximum independent set problem. [Citation Graph (, )][DBLP]
On the Local Colorings of Graphs. [Citation Graph (, )][DBLP]
Local coloring of Kneser graphs. [Citation Graph (, )][DBLP]
On b-coloring of the Kneser graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|