
Search the dblp DataBase
Irith BenArroyo Hartman:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Irith BenArroyo Hartman
Optimal KColoring and KNesting of Intervals. [Citation Graph (0, 0)][DBLP] ISTCS, 1992, pp:207220 [Conf]
 Irith BenArroyo Hartman
Berge's conjecture on directed path partitions  a survey. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:1920, pp:24982514 [Journal]
 Irith BenArroyo Hartman
Variations on the GallaiMilgram theorem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:71, n:2, pp:95105 [Journal]
 Irith BenArroyo Hartman, Ilan Newman, Ran Ziv
On grid intersection graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:87, n:1, pp:4152 [Journal]
 S. Bellantoni, Irith BenArroyo Hartman, Teresa M. Przytycka, Sue Whitesides
Grid intersection graphs and boxicity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:114, n:13, pp:4149 [Journal]
 Ron Aharoni, Irith BenArroyo Hartman
On GreeneKleitman's theorem for general digraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:120, n:13, pp:1324 [Journal]
On Path Partitions and Colourings in Digraphs. [Citation Graph (, )][DBLP]
On path partitions and colourings in digraphs. [Citation Graph (, )][DBLP]
Editorial. [Citation Graph (, )][DBLP]
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. [Citation Graph (, )][DBLP]
Proof of Berge's strong path partition conjecture for k=2. [Citation Graph (, )][DBLP]
Search in 0.011secs, Finished in 0.012secs
