Color-bounded hypergraphs, IV: Stable colorings of hypertrees

DOI10.1016/j.disc.2009.07.014zbMath1219.05055OpenAlexW2035920313WikidataQ59072680 ScholiaQ59072680MaRDI QIDQ968415

Csilla Bujtás, Zsolt Tuza

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

zbMATH Keywords

algorithmic complexitymixed hypergraphhypertreehypergraph coloringinterval hypergraphstably bounded hypergraph

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On perfection and imperfection of one-realizations of a given set ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Problems on cycles and colorings ⋮ On the structure of uniform one-realizations of a given set ⋮ Constrained colouring and \(\sigma\)-hypergraphs

Cites Work

• Color-bounded hypergraphs. I: General results
• Tight approximations for resource constrained scheduling and bin packing
• Coloring mixed hypergraphs: theory, algorithms and applications
• Mixed hypercacti
• On feasible sets of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Mixed colorings of hypergraphs
• Chromatic polynomials of hypergraphs
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Color-bounded hypergraphs, IV: Stable colorings of hypertrees