Mixed colorings of hypergraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Mixed graph edge coloring
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Mixed interval hypergraphs
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
- Integer programming models for colorings of mixed hypergraphs
- Colorability of mixed hypergraphs and their chromatic inversions
- Uniform mixed hypergraphs: the possible numbers of colors
- Coloring mixed hypertrees
- Hypergraph colouring
- New challenges in the theory of hypergraph coloring
- scientific article; zbMATH DE number 4014765 (Why is no real title available?)
- Mixing 3-Colourings in Bipartite Graphs
- scientific article; zbMATH DE number 5177332 (Why is no real title available?)
- scientific article; zbMATH DE number 1491631 (Why is no real title available?)
- Mixed hypergraphs and beyond
- scientific article; zbMATH DE number 5202627 (Why is no real title available?)
- On planar mixed hypergraphs
- Coloring some classes of mixed graphs
- Mixed hypergraphs and other coloring problems
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
This page was built for publication: Mixed colorings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439449)