Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees

DOI10.1016/j.disc.2008.10.023zbMath1225.05189OpenAlexW1979601578WikidataQ59072713 ScholiaQ59072713MaRDI QIDQ1045172

Csilla Bujtás, Zsolt Tuza

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.023

zbMATH Keywords

chromatic spectrumvertex coloringmixed hypergraphhypertreefeasible setinterval hypergraphcircular hypergraph

Mathematics Subject Classification ID

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

Related Items (9)

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 ⋮ Path-based supports for hypergraphs ⋮ Path-Based Supports for Hypergraphs ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ Mixed hypergraphs and beyond

Cites Work

• Mixed interval hypergraphs
• Uniquely colorable mixed hypergraphs
• The chromatic spectrum of mixed hypergraphs
• Mixed hypercacti
• On feasible sets of mixed hypergraphs
• Circular mixed hypergraphs. II: The upper chromatic number
• Mixed colorings of hypergraphs
• Chromatic polynomials of hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees