Mixed hypercacti (Q1883259): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2003.11.051 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2911383922 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57601590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bicoloring Steiner triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4256358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The chromatic spectrum of mixed hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4782746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2766689 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4779166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniquely colorable mixed hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4842710 / rank | |||
Normal rank |
Latest revision as of 11:16, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mixed hypercacti |
scientific article |
Statements
Mixed hypercacti (English)
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
mixed hypergraph
0 references
hypercactus
0 references