Maximum number of colors in hypertrees of bounded degree

Csilla Bujtás, Z. Tuza

Research output: Contribution to journalArticle

Abstract

The upper chromatic number (Formula presented.) of a hypergraph (Formula presented.) is the maximum number of colors that can occur in a vertex coloring φ:X→N such that no edge 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 χ¯, unless P=NP. In sharp contrast to this, here we prove that if the input is restricted to hypertrees H of bounded maximum vertex degree, then χ¯(H) can be determined in linear time if an underlying tree is also given in the input. Consequently, χ¯ on hypertrees is fixed parameter tractable in terms of maximum degree.

Original languageEnglish
Pages (from-to)867-876
Number of pages10
JournalCentral European Journal of Operations Research
Volume23
Issue number4
DOIs
Publication statusPublished - Dec 1 2015

Fingerprint

Hypergraph
Graph

Keywords

  • Arboreal hypergraph
  • C-coloring
  • Hypergraph
  • Hypertree
  • Upper chromatic number
  • Vertex coloring

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Maximum number of colors in hypertrees of bounded degree. / Bujtás, Csilla; Tuza, Z.

In: Central European Journal of Operations Research, Vol. 23, No. 4, 01.12.2015, p. 867-876.

Research output: Contribution to journalArticle

@article{ce7fa37417e842f7a9b75cb33579defd,
title = "Maximum number of colors in hypertrees of bounded degree",
abstract = "The upper chromatic number (Formula presented.) of a hypergraph (Formula presented.) is the maximum number of colors that can occur in a vertex coloring φ:X→N such that no edge 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 χ¯, unless P=NP. In sharp contrast to this, here we prove that if the input is restricted to hypertrees H of bounded maximum vertex degree, then χ¯(H) can be determined in linear time if an underlying tree is also given in the input. Consequently, χ¯ on hypertrees is fixed parameter tractable in terms of maximum degree.",
keywords = "Arboreal hypergraph, C-coloring, Hypergraph, Hypertree, Upper chromatic number, Vertex coloring",
author = "Csilla Bujt{\'a}s and Z. Tuza",
year = "2015",
month = "12",
day = "1",
doi = "10.1007/s10100-014-0357-4",
language = "English",
volume = "23",
pages = "867--876",
journal = "Central European Journal of Operations Research",
issn = "1435-246X",
publisher = "Physica-Verlag",
number = "4",

}

TY - JOUR

T1 - Maximum number of colors in hypertrees of bounded degree

AU - Bujtás, Csilla

AU - Tuza, Z.

PY - 2015/12/1

Y1 - 2015/12/1

N2 - The upper chromatic number (Formula presented.) of a hypergraph (Formula presented.) is the maximum number of colors that can occur in a vertex coloring φ:X→N such that no edge 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 χ¯, unless P=NP. In sharp contrast to this, here we prove that if the input is restricted to hypertrees H of bounded maximum vertex degree, then χ¯(H) can be determined in linear time if an underlying tree is also given in the input. Consequently, χ¯ on hypertrees is fixed parameter tractable in terms of maximum degree.

AB - The upper chromatic number (Formula presented.) of a hypergraph (Formula presented.) is the maximum number of colors that can occur in a vertex coloring φ:X→N such that no edge 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 χ¯, unless P=NP. In sharp contrast to this, here we prove that if the input is restricted to hypertrees H of bounded maximum vertex degree, then χ¯(H) can be determined in linear time if an underlying tree is also given in the input. Consequently, χ¯ on hypertrees is fixed parameter tractable in terms of maximum degree.

KW - Arboreal hypergraph

KW - C-coloring

KW - Hypergraph

KW - Hypertree

KW - Upper chromatic number

KW - Vertex coloring

UR - http://www.scopus.com/inward/record.url?scp=84957957545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957957545&partnerID=8YFLogxK

U2 - 10.1007/s10100-014-0357-4

DO - 10.1007/s10100-014-0357-4

M3 - Article

VL - 23

SP - 867

EP - 876

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

SN - 1435-246X

IS - 4

ER -