Mixed hypergraphs and other coloring problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5296053
- Mixed colorings of hypergraphs
- scientific article; zbMATH DE number 5202641
- scientific article; zbMATH DE number 5202627
- Coloring mixed hypergraphs: theory, algorithms and applications
- scientific article; zbMATH DE number 1491631
- On two coloring problems in mixed graphs
- Mixed graph colorings
- Colouring planar mixed hypergraphs
- Coloring some classes of mixed graphs
Cites work
- scientific article; zbMATH DE number 1696541 (Why is no real title available?)
- scientific article; zbMATH DE number 1236360 (Why is no real title available?)
- scientific article; zbMATH DE number 1341914 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 1944137 (Why is no real title available?)
- scientific article; zbMATH DE number 2038757 (Why is no real title available?)
- scientific article; zbMATH DE number 2080268 (Why is no real title available?)
- scientific article; zbMATH DE number 1834657 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- A Theorem about the Channel Assignment Problem
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Circular chromatic number: A survey
- Circular mixed hypergraphs. I: Colorability and unique colorability
- Coloring mixed hypergraphs: theory, algorithms and applications
- Labelling Graphs with a Condition at Distance 2
- Mixed hypercacti
- Mixed interval hypergraphs
- On feasible sets of mixed hypergraphs
- On the complexity of H-coloring
- On the span in channel assignment problems: Bounds, computing and counting
- Partial covers of graphs
- Star chromatic number
- The chromatic spectrum of mixed hypergraphs
- \(T\)-colorings of graphs
- \(T\)-colorings of graphs: recent results and open problems
Cited in
(26)- Color-bounded hypergraphs. I: General results
- Coloring mixed hypertrees
- On the structure of uniform one-realizations of a given set
- Zero-free intervals of chromatic polynomials of hypergraphs
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- Spectrum of mixed bi-uniform hypergraphs
- More results on the smallest one-realization of a given set. II
- On perfect balanced rainbow-free colorings and complete colorings of projective spaces
- Complexity of two coloring problems in cubic planar bipartite mixed graphs
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
- Mixed hypergraphs and beyond
- Colorability of mixed hypergraphs and their chromatic inversions
- Mixed colorings of hypergraphs
- Pattern hypergraphs
- scientific article; zbMATH DE number 5177332 (Why is no real title available?)
- Chromatic spectrum is broken
- Circular mixed hypergraphs. I: Colorability and unique colorability
- Coloring mixed hypergraphs: theory, algorithms and applications
- The smallest one-realization of a given set. IV
- scientific article; zbMATH DE number 5202627 (Why is no real title available?)
- On two coloring problems in mixed graphs
- Uniform mixed hypergraphs: the possible numbers of colors
- Integer programming models for colorings of mixed hypergraphs
- On perfection and imperfection of one-realizations of a given set
- More result on the smallest one-realization of a given set
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
This page was built for publication: Mixed hypergraphs and other coloring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868365)
