The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ebadollah S. Mahmoodian: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mohammad Ghebleh, Ebadollah S. Mahmoodian
    On Uniquely List Colorable Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  2. Mohammad Mahdian, Ebadollah S. Mahmoodian
    A Characterization of Uniquely 2-List Colorable Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  3. 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]
  4. Nasrin Soltankhah, Ebadollah S. Mahmoodian
    On defining numbers of k-chromatic k-regular graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  5. Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian
    The three-way intersection problem for latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:1-19 [Journal]
  6. Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian
    On the forced matching numbers of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:1-12 [Journal]
  7. Richard Bean, Ebadollah S. Mahmoodian
    A new bound on the size of the largest critical set in a Latin square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:267, n:1-3, pp:13-21 [Journal]
  8. Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian
    On the size of the minimum critical set of a Latin square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:121-127 [Journal]
  9. Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani
    On the simultaneous edge-coloring conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:267-272 [Journal]
  10. Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani
    On a conjecture of Keedwell and the cycle double cover conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:287-292 [Journal]
  11. Ebadollah S. Mahmoodian, Eric Mendelsohn
    On defining numbers of vertex colouring of regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:543-554 [Journal]
  12. 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]
  13. Charles J. Colbourn, Ebadollah S. Mahmoodian
    The spectrum of support sizes for threefold triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:1, pp:9-19 [Journal]
  14. Charles J. Colbourn, Ebadollah S. Mahmoodian
    Support sizes of sixfold triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:103-131 [Journal]
  15. Mehdi Behzad, Ebadollah S. Mahmoodian
    Eccentric sequences and triangle sequences of block designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:47-56 [Journal]

  16. On minimum vertex cover of generalized Petersen graphs [Citation Graph (, )][DBLP]


  17. Vertex domination of generalized Petersen graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002