Mixed hypercacti
type: Item
instance of: scholarly article
title: Mixed hypercacti
zbMATH Open document ID: 1064.05060
author: Daniel Král'
author: Jan Kratochvíl
author: Heinz-Juergen Voss
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
review text: 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.
reviewed by: Alain Bretto
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 2105617
zbMATH Keywords: mixed hypergraph
zbMATH Keywords: hypercactus
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.051
OpenAlex ID: W2911383922
Wikidata QID: Q57601590
cites work: Q5422499
cites work: Bicoloring Steiner triple systems
cites work: Q4256358
cites work: The chromatic spectrum of mixed hypergraphs
cites work: Q4782746
cites work: Q2766689
cites work: Q4779166
cites work: Q4263476
cites work: Uniquely colorable mixed hypergraphs
cites work: Q4842710
DOI: 10.1016/J.DISC.2003.11.051
description: scientific article; zbMATH DE number 2105617