Combinatorial problems on H-graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10368821" target="_blank" >RIV/00216208:11320/17:10368821 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.042" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.06.042</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.042" target="_blank" >10.1016/j.endm.2017.06.042</a>
Alternative languages
Result language
angličtina
Original language name
Combinatorial problems on H-graphs
Original language description
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a fixed graph H. They naturally generalize many important classes of graphs. We continue their study by considering coloring, clique, and isomorphism problems. We show that if H contains a certain multigraph as a minor, then H-graphs are GI-complete and the clique problem is APX-hard. Also, when H is a cactus the clique problem can be solved in polynomial time and when a graph G has a Helly H-representation, the clique problem can be solved in polynomial time. We use treewidth to show that both the k-clique and list k-coloring problems are FPT on H-graphs. These results also apply to treewidth-bounded classes where treewidth is bounded by a function of the clique number.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Notes in Discrete Mathematics
ISSN
1571-0653
e-ISSN
—
Volume of the periodical
61
Issue of the periodical within the volume
August
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
223-229
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85026769520