The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hossein Hajiabolhassan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
    A Note on the Hall-Condition Number of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  2. Amir Daneshgar, Hossein Hajiabolhassan
    Unique list-colourability and the fixing chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:123-138 [Journal]
  3. Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad
    Uniquely 2-list colorable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:119, n:3, pp:217-225 [Journal]
  4. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
    Minimal coloring and strength of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:265-270 [Journal]
  5. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
    Tabular graphs and chromatic sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:11-22 [Journal]
  6. Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
    On defining numbers of circular complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:173-180 [Journal]
  7. Hossein Hajiabolhassan, Xuding Zhu
    Sparse H-Colourable Graphs of Bounded Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:1, pp:65-71 [Journal]
  8. Hossein Hajiabolhassan, Xuding Zhu
    Circular chromatic number of Kneser graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:299-303 [Journal]
  9. Abbas Cheraghi, Hossein Hajiabolhassan
    Lower Bound for Visual Cryptography Schemes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  10. 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]

  11. On Connected Colourings of Graphs. [Citation Graph (, )][DBLP]


  12. On the b-chromatic number of Kneser graphs. [Citation Graph (, )][DBLP]


  13. Bounds for visual cryptography schemes. [Citation Graph (, )][DBLP]


  14. Density and power graphs in graph homomorphism problem. [Citation Graph (, )][DBLP]


  15. On colorings of graph powers. [Citation Graph (, )][DBLP]


  16. Circular coloring and Mycielski construction. [Citation Graph (, )][DBLP]


  17. A generalization of the Erdös-Ko-Rado theorem. [Citation Graph (, )][DBLP]


  18. Circular colouring and algebraic no-homomorphism theorems. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.060secs
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