Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees

DOI10.1016/j.disc.2008.10.023zbMath1225.05189WikidataQ59072713 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 spectrum; vertex coloring; mixed hypergraph; hypertree; feasible set; interval hypergraph; circular hypergraph

Mathematics Subject Classification ID

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

Mixed hypergraphs and beyond, On perfection and imperfection of one-realizations of a given set, Color-bounded hypergraphs. VI: Structural and functional jumps in complexity, Problems on cycles and colorings, Path-based supports for hypergraphs, On the structure of uniform one-realizations of a given set, Constrained colouring and \(\sigma\)-hypergraphs, The smallest uniform color-bounded hypergraphs which are one-realizations of a given set, Path-Based Supports for Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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