Perfect arborescence packing in preflow mincut graphs

Two graphs G and H with the same vertex set V are P₄-isomorphic if every four vertices {a,b,c,d} \subseteq V$ induce a chordless path (denoted by P₄) in G if and only if they induce a P₄ in H. We call a graph split-perfect if it is P₄-isomorphic to a ...

Zhu [X. Zhu, Circular-perfect graphs, J. Graph Theory 48 (2005) 186-209] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important @g-bound class of graphs with the smallest non-trivial @g-binding function @...

A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a ...