The following pages link to Irith Ben-Arroyo Hartman (Q1055429):
Displaying 19 items.
- (Q685650) (redirect page) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- Long cycles generate the cycle space of a graph (Q1055430) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Group planning with time constraints (Q2248560) (← links)
- Scalability issues in optimal assignment for carpooling (Q2254279) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Proof of Berge's strong path partition conjecture for \(k=2\) (Q2462329) (← links)
- (Q2721331) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- (Q3963042) (← links)
- On greene's theorem for digraphs (Q4284103) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
- (Q4694780) (← links)
- (Q5197582) (← links)
