Mixed hypercacti
A graph is a strong (resp. weak) cactus if all its cycles are vector (resp. wedge) disjoint. A hypergraph is a strong (resp. weak) hypercactus if it is spanned by a strong (resp. weak) cactus (here spanned means that there is a graph on the same vertices such that any hyperedges induce a connected subgraph). A mixed hypergraph \(H\) is a triple \((V,{\mathcal C},{\mathcal D})\) where \(V\) is its vertex set and \(\mathcal C\) and \(\mathcal D\) are families of subsets of \(V\) (called \(\mathcal C\)-edges and \(\mathcal D\)-edges). This paper studies the colorings of mixed hypercacti.
scientific article; zbMATH DE number 2105617