The following pages link to Covering digraphs by paths (Q1250116):
Displaying 16 items.
- On Linial's conjecture for spine digraphs (Q512554) (← links)
- On the strong path partition conjecture of Berge (Q686176) (← links)
- About colorings, stability and paths in directed graphs (Q1120589) (← links)
- Extending the Greene-Kleitman theorem to directed graphs (Q1155625) (← links)
- k-optimal partitions of a directed graph (Q1172068) (← links)
- On the Berge's strong path partition conjecture (Q1210577) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Diperfect graphs (Q1838975) (← links)
- On the strong and the semi-strong path partition conjecture (Q1985941) (← links)
- Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs (Q2000583) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Design of test inputs and their sequences in multi-function system testing (Q2505033) (← links)
- An algorithmic note on the gallai-milgram theorem (Q3033587) (← links)
- Minimum path decompositions of oriented cubic graphs (Q3744186) (← links)
- On greene's theorem for digraphs (Q4284103) (← links)
- BE-diperfect digraphs with stability number two (Q6574382) (← links)
