If D is a finite digraph, a directed cut is a subset of arcs in D having tail in some subset X ⊆ V(D) and head in V(D) X. In this paper we prove two general results concerning intersections between maximal paths, cycles and maximal directed cuts in D. As a direct consequence of these results, we deduce that there is a path, or a cycle, in D that crosses each maximal directed cut.
Intersection properties of maximal directed cuts in digraphs
Giampiero Chiaselotti
;Tommaso Gentile
2017-01-01
Abstract
If D is a finite digraph, a directed cut is a subset of arcs in D having tail in some subset X ⊆ V(D) and head in V(D) X. In this paper we prove two general results concerning intersections between maximal paths, cycles and maximal directed cuts in D. As a direct consequence of these results, we deduce that there is a path, or a cycle, in D that crosses each maximal directed cut.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
