Maximum number of colors in hypertrees of bounded degree

DOI10.1007/s10100-014-0357-4zbMath1339.05115OpenAlexW2094356036WikidataQ59072501 ScholiaQ59072501MaRDI QIDQ302137

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

hypergraphvertex coloringhypertreearboreal hypergraphC-coloringupper chromatic number

Mathematics Subject Classification ID

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

Related Items (1)

Editorial

Cites Work

• Unnamed Item
• Maximum number of colors: C-coloring and related problems
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Upper chromatic number of finite projective planes
• On the minimum size of tight hypergraphs

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