The SCEAS System
Navigation Menu

Search the dblp DataBase


Irith Ben-Arroyo Hartman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Irith Ben-Arroyo Hartman
    Optimal K-Coloring and K-Nesting of Intervals. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:207-220 [Conf]
  2. Irith Ben-Arroyo Hartman
    Berge's conjecture on directed path partitions - a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2498-2514 [Journal]
  3. Irith Ben-Arroyo Hartman
    Variations on the Gallai-Milgram theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:2, pp:95-105 [Journal]
  4. Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv
    On grid intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:41-52 [Journal]
  5. S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides
    Grid intersection graphs and boxicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:41-49 [Journal]
  6. Ron Aharoni, Irith Ben-Arroyo Hartman
    On Greene-Kleitman's theorem for general digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:13-24 [Journal]

  7. On Path Partitions and Colourings in Digraphs. [Citation Graph (, )][DBLP]

  8. On path partitions and colourings in digraphs. [Citation Graph (, )][DBLP]

  9. Editorial. [Citation Graph (, )][DBLP]

  10. The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. [Citation Graph (, )][DBLP]

  11. Proof of Berge's strong path partition conjecture for k=2. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
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