Color-bounded hypergraphs, IV: Stable colorings of hypertrees
From MaRDI portal
Publication:968415
DOI10.1016/J.DISC.2009.07.014zbMATH Open1219.05055DBLPjournals/dm/BujtasT10OpenAlexW2035920313WikidataQ59072680 ScholiaQ59072680MaRDI QIDQ968415FDOQ968415
Publication date: 5 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.014
hypertreemixed hypergraphhypergraph coloringalgorithmic complexityinterval hypergraphstably bounded hypergraph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Color-bounded hypergraphs. I: General results
- Uncolorable mixed hypergraphs
- Chromatic polynomials of hypergraphs
- Tight approximations for resource constrained scheduling and bin packing
- Mixed hypercacti
- Gaps in the chromatic spectrum of face-constrained plane graphs
- Mixed colorings of hypergraphs
Cited In (8)
- On perfection and imperfection of one-realizations of a given set
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- On the structure of uniform one-realizations of a given set
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- Problems on cycles and colorings
- Constrained colouring and \(\sigma\)-hypergraphs
This page was built for publication: Color-bounded hypergraphs, IV: Stable colorings of hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968415)
