scientific article; zbMATH DE number 3887740
From MaRDI portal
Publication:3222234
[For the entire collection see Zbl 0546.00006.] The authors positively answer the question is every normal hypergraph bichromatic by proving that a hypergraph with no odd cycles of maximal degree two is bichromatic. In an equivalent form, the set of all maximal cliques of a perfect graph can be partitioned into two classes such that these classes are represented at each vertex contained in at least two maximal cliques. A few results concerning the non-bichromatic hypergraphs are also provided in the paper.
Recommendations
Cited in
(6)- Some properties of non-bicolorable hypergraphs and the four-color problem
- Incidence graphs of biacyclic hypergraphs
- A sufficient condition for the bicolorability of a hypergraph
- scientific article; zbMATH DE number 4072998 (Why is no real title available?)
- On the complexity of bicoloring clique hypergraphs of graphs
- scientific article; zbMATH DE number 1445283 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222234)