Mixed hypergraphs and other coloring problems
From MaRDI portal
Publication:868365
DOI10.1016/j.disc.2005.11.050zbMath1117.05043OpenAlexW2083020053WikidataQ57601516 ScholiaQ57601516MaRDI QIDQ868365
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.050
Related Items (10)
Spectrum of mixed bi-uniform 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 ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ The smallest one-realization of a given set. IV ⋮ On the balanced upper chromatic number of cyclic projective planes and projective spaces ⋮ Color-bounded hypergraphs. I: General results
Cites Work
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- On the complexity of H-coloring
- \(T\)-colorings of graphs: recent results and open problems
- \(T\)-colorings of graphs
- Mixed interval hypergraphs
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On the span in channel assignment problems: Bounds, computing and counting
- Mixed hypercacti
- On feasible sets of mixed hypergraphs
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Star chromatic number
- Labelling Graphs with a Condition at Distance 2
- A Theorem about the Channel Assignment Problem
- Partial covers of graphs
- Circular chromatic number: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mixed hypergraphs and other coloring problems
