The SCEAS System
Navigation Menu

Search the dblp DataBase


Manouchehr Zaker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manouchehr Zaker
    Maximum transversal in partial Latin squares and rainbow matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:558-565 [Journal]
  2. Mekkia Kouider, Manouchehr Zaker
    Bounds for the b-chromatic number of some families of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:617-623 [Journal]
  3. Manouchehr Zaker
    Results on the Grundy chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3166-3173 [Journal]
  4. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
    A characterization of uniquely vertex colorable graphs using minimal defining sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:233-236 [Journal]
  5. Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker
    Defining sets in vertex colorings of graphs and latin rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:451-460 [Journal]

  6. Greedy Defining Sets in Latin Squares. [Citation Graph (, )][DBLP]

  7. Inequalities for the Grundy chromatic number of graphs. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002