Mixed hypercacti

DOI10.1016/J.DISC.2003.11.051MaRDI QIDQ1883259zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Král', Jan Kratochvíl, Heinz-Juergen Voss

Publication date 1 October 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2003.11.051

zbMATH Keywords

hypercactusmixed hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

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.

Recommendations

• Circular mixed hypergraphs. I: Colorability and unique colorability
• About uniquely colorable mixed hypertrees
• Circular and uniquely colorable mixed hypergraphs
• Coloring mixed hypertrees

Cites work

• Bicoloring Steiner triple systems
• Graph theory
• scientific article; zbMATH DE number 1696541 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• scientific article; zbMATH DE number 1834670 (Why is no real title available?)
• scientific article; zbMATH DE number 1839477 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• The chromatic spectrum of mixed hypergraphs
• Uniquely colorable mixed hypergraphs

Cited in

(9)

• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• A characterization of hypercacti
• Circular mixed hypergraphs. II: The upper chromatic number
• Chromatic polynomials of mixed hypercycles
• Path-based supports for hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Path-based supports for hypergraphs
• Mixed hypergraphs and other coloring problems
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees

This page was built for publication: Mixed hypercacti

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883259)