Maximum number of colors in hypertrees of bounded degree

Csilla Bujtás () and Zsolt Tuza

Central European Journal of Operations Research, 2015, vol. 23, issue 4, 867-876

Abstract: The upper chromatic number $$\overline{\chi }(\mathcal{H})$$ χ ¯ ( H ) of a hypergraph $$\mathcal{H}=(X,\mathcal{E})$$ H = ( X , E ) is the maximum number of colors that can occur in a vertex coloring $$\varphi :X\rightarrow \mathbb {N}$$ φ : X → N such that no edge $$E\in \mathcal{E}$$ E ∈ E is completely multicolored. A hypertree (also called arboreal hypergraph) is a hypergraph whose edges induce subtrees on a fixed tree graph. It has been shown that on hypertrees it is algorithmically hard not only to determine exactly but also to approximate the value of $$\overline{\chi }$$ χ ¯ , unless $$\mathsf{P}=\mathsf{NP}$$ P = NP . In sharp contrast to this, here we prove that if the input is restricted to hypertrees $$\mathcal{H}$$ H of bounded maximum vertex degree, then $$\overline{\chi }(\mathcal{H})$$ χ ¯ ( H ) can be determined in linear time if an underlying tree is also given in the input. Consequently, $$\overline{\chi }$$ χ ¯ on hypertrees is fixed parameter tractable in terms of maximum degree. Copyright Springer-Verlag Berlin Heidelberg 2015

Keywords: Hypergraph; Hypertree; Arboreal hypergraph; Vertex coloring; C-coloring; Upper chromatic number; 05C15; 05C65; 05C85 (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10100-014-0357-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:23:y:2015:i:4:p:867-876

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-014-0357-4

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().