Mixed hypercacti (Q1883259): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q598470
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Heinz-Juergen Voss / rank
 
Normal rank

Revision as of 22:43, 19 February 2024

scientific article
Language Label Description Also known as
English
Mixed hypercacti
scientific article

    Statements

    Mixed hypercacti (English)
    0 references
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    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.
    0 references
    0 references
    0 references
    mixed hypergraph
    0 references
    hypercactus
    0 references