DBLP: Irith Ben-Arroyo Hartman

	2012
j10		Eli Berger, Irith Ben-Arroyo Hartman: A unified approach to known and unknown cases of Berge's conjecture. Journal of Graph Theory 71(3): 317-330 (2012)
	2009
c3		Irith Ben-Arroyo Hartman: On Path Partitions and Colourings in Digraphs. Graph Theory, Computational Intelligence and Thought 2009: 134-143
	2008
j9		Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discrete Applied Mathematics 156(4): 407-408 (2008)
j8		Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: Editorial. Discrete Applied Mathematics 156(4): 410-411 (2008)
j7		Eli Berger, Irith Ben-Arroyo Hartman: Proof of Berge's strong path partition conjecture for k=2. Eur. J. Comb. 29(1): 179-192 (2008)
	2007
c2		Irith Ben-Arroyo Hartman: On path partitions and colourings in digraphs. CTW 2007: 63-66
	2006
j6		Irith Ben-Arroyo Hartman: Berge's conjecture on directed path partitions - a survey. Discrete Mathematics 306(19-20): 2498-2514 (2006)
	1994
j5		Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz: On greene's theorem for digraphs. Journal of Graph Theory 18(2): 169-175 (1994)
	1993
j4		S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides: Grid intersection graphs and boxicity. Discrete Mathematics 114(1-3): 41-49 (1993)
j3		Ron Aharoni, Irith Ben-Arroyo Hartman: On Greene-Kleitman's theorem for general digraphs. Discrete Mathematics 120(1-3): 13-24 (1993)
	1992
c1		Irith Ben-Arroyo Hartman: Optimal K-Coloring and K-Nesting of Intervals. ISTCS 1992: 207-220
	1991
j2		Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv: On grid intersection graphs. Discrete Mathematics 87(1): 41-52 (1991)
	1988
j1		Irith Ben-Arroyo Hartman: Variations on the Gallai-Milgram theorem. Discrete Mathematics 71(2): 95-105 (1988)

2012

j10

Eli Berger, Irith Ben-Arroyo Hartman: A unified approach to known and unknown cases of Berge's conjecture. Journal of Graph Theory 71(3): 317-330 (2012)

2009

Irith Ben-Arroyo Hartman: On Path Partitions and Colourings in Digraphs. Graph Theory, Computational Intelligence and Thought 2009: 134-143

2008

Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discrete Applied Mathematics 156(4): 407-408 (2008)

Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: Editorial. Discrete Applied Mathematics 156(4): 410-411 (2008)

Eli Berger, Irith Ben-Arroyo Hartman: Proof of Berge's strong path partition conjecture for k=2. Eur. J. Comb. 29(1): 179-192 (2008)

2007

Irith Ben-Arroyo Hartman: On path partitions and colourings in digraphs. CTW 2007: 63-66

2006

Irith Ben-Arroyo Hartman: Berge's conjecture on directed path partitions - a survey. Discrete Mathematics 306(19-20): 2498-2514 (2006)

1994

Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz: On greene's theorem for digraphs. Journal of Graph Theory 18(2): 169-175 (1994)

1993

S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides: Grid intersection graphs and boxicity. Discrete Mathematics 114(1-3): 41-49 (1993)

Ron Aharoni, Irith Ben-Arroyo Hartman: On Greene-Kleitman's theorem for general digraphs. Discrete Mathematics 120(1-3): 13-24 (1993)

1992

Irith Ben-Arroyo Hartman: Optimal K-Coloring and K-Nesting of Intervals. ISTCS 1992: 207-220

1991

Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv: On grid intersection graphs. Discrete Mathematics 87(1): 41-52 (1991)

1988

Irith Ben-Arroyo Hartman: Variations on the Gallai-Milgram theorem. Discrete Mathematics 71(2): 95-105 (1988)

1	Ron Aharoni	[j3]
2	S. Bellantoni	[j4]
3	Eli Berger	[j10] [j7]
4	Daniel Hershkowitz	[j5]
5	Joseph Naor (Seffi Naor)	[j9] [j8]
6	Ilan Newman	[j2]
7	Michal Penn	[j9] [j8]
8	Teresa M. Przytycka	[j4]
9	Uriel G. Rothblum	[j9] [j8]
10	Fathi Saleh	[j5]
11	Sue Whitesides	[j4]
12	Ran Ziv	[j2]

Irith Ben-Arroyo Hartman

Coauthor Index