Colouring planar mixed hypergraphs
From MaRDI portal
The authors show that maximal planar bi-hypergraphs are 2-colorable. They also find formulas for their chromatic polynomial and chromatic spectrum in terms of 2-factors in the dual. Furthermore, they show that their chromatic spectrum is gap-free and give an estimate on the number of colors in a coloring.
Recommendations
Cited in
(25)- On maximum face-constrained coloring of plane graphs with no short face cycles.
- The chromatic spectrum of a Ramsey mixed hypergraph
- On the structure of uniform one-realizations of a given set
- More results on the smallest one-realization of a given set. II
- Coloring face-hypergraphs of graphs on surfaces
- The \(k\)-annihilating-ideal hypergraph of commutative ring
- Facially-constrained colorings of plane graphs: a survey
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
- Coloring mixed hypertrees
- The smallest one-realization of a given set. IV
- On perfection and imperfection of one-realizations of a given set
- More result on the smallest one-realization of a given set
- scientific article; zbMATH DE number 5177332 (Why is no real title available?)
- 3-Colorability of plane hypergraphs
- Non-monochromatic non-rainbow colourings of -hypergraphs
- scientific article; zbMATH DE number 1491627 (Why is no real title available?)
- WORM colorings of planar graphs
- scientific article; zbMATH DE number 5202627 (Why is no real title available?)
- On planar mixed hypergraphs
- On planar mixed hypergraphs
- Looseness of plane graphs
- Coloring face hypergraphs on surfaces
- The smallest one-realization of a given set. III
- Mixed hypergraphs and other coloring problems
- Complexity of two coloring problems in cubic planar bipartite mixed graphs
This page was built for publication: Colouring planar mixed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591737)
