On planar mixed hypergraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1869704
- Colouring planar mixed hypergraphs
- On feasible sets of mixed hypergraphs
- The smallest 3-uniform bi-hypergraph which is a realization of a given vector
- scientific article; zbMATH DE number 1696541
- 3-Colorability of plane hypergraphs
- scientific article; zbMATH DE number 5296053
- A note on the colorability of mixed hypergraph using \(k\) colors
- Mixed colorings of hypergraphs
- More result on the smallest one-realization of a given set
Cited in
(18)- Mixing 3-colourings in bipartite graphs
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- Colouring planar mixed hypergraphs
- On the upper chromatic number of (v₃,b₂)-configurations
- Chords of 2-factors in planar cubic bridgeless graphs
- Facially-constrained colorings of plane graphs: a survey
- Coloring mixed hypertrees
- scientific article; zbMATH DE number 4047771 (Why is no real title available?)
- 3-Colorability of plane hypergraphs
- scientific article; zbMATH DE number 4072998 (Why is no real title available?)
- Non-monochromatic non-rainbow colourings of -hypergraphs
- scientific article; zbMATH DE number 1491627 (Why is no real title available?)
- scientific article; zbMATH DE number 1839477 (Why is no real title available?)
- Mixed hypergraphs and beyond
- WORM colorings of planar graphs
- scientific article; zbMATH DE number 6438474 (Why is no real title available?)
- On planar mixed hypergraphs
- Coloring face hypergraphs on surfaces
This page was built for publication: On planar mixed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948492)