Maximum number of colors in hypertrees of bounded degree

DOI10.1007/S10100-014-0357-4MaRDI QIDQ302137zbMATHOpenAlexWikidataFDO

Authors Csilla Bujtás, Zsolt Tuza

Publication date 4 July 2016

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL http://real.mtak.hu/33603/1/C_htree_boundeddegreeR_u.pdf

zbMATH Keywords

hypergraphhypertreevertex coloringarboreal hypergraphC-coloringupper chromatic number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Approximability of the upper chromatic number of hypergraphs
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Publication:4782746
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Publication:2766689

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• Coloring mixed hypergraphs: theory, algorithms and applications
• Maximum number of colors: C-coloring and related problems
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• On feasible sets of mixed hypergraphs
• On the minimum size of tight hypergraphs
• Upper chromatic number of finite projective planes

Cited in

(4)

• Maximum number of colors: C-coloring and related problems
• Editorial
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Approximability of the upper chromatic number of hypergraphs

This page was built for publication: Maximum number of colors in hypertrees of bounded degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q302137)