Combinatorial Problems on H-graphs

Steven Chaplick; Peter Zeman

doi:10.1016/J.ENDM.2017.06.042

Combinatorial Problems on H-graphs

Steven Chaplick^*, Peter Zeman^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

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. Whe 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.

Original language	English
Pages (from-to)	223-229
Journal	Electronic Notes in Discrete Mathematics
Volume	61
DOIs	https://doi.org/10.1016/J.ENDM.2017.06.042
Publication status	Published - 2017
Externally published	Yes

Access to Document

10.1016/J.ENDM.2017.06.042

1 Article
1 Preprint

On H-Topological Intersection Graphs
Chaplick, S., Topfer, M., Vobornik, J. & Zeman, P., Nov 2021, In: Algorithmica. 83, 11, p. 3281-3318 38 p.
Research output: Contribution to journal › Article › Academic › peer-review
Combinatorial Problems on $H$-graphs
Chaplick, S. & Zeman, P., 2017, 10 p.
Research output: Working paper / Preprint › Preprint

Cite this

@article{467e2e407e864ab2a813b317ee5f0945,

title = "Combinatorial Problems on H-graphs",

abstract = "Bir{\'o}, 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. Whe 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.",

author = "Steven Chaplick and Peter Zeman",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2017",

doi = "10.1016/J.ENDM.2017.06.042",

language = "English",

volume = "61",

pages = "223--229",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Combinatorial Problems on H-graphs

AU - Chaplick, Steven

AU - Zeman, Peter

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2017

Y1 - 2017

N2 - 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. Whe 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.

AB - 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. Whe 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.

U2 - 10.1016/J.ENDM.2017.06.042

DO - 10.1016/J.ENDM.2017.06.042

M3 - Article

SN - 1571-0653

VL - 61

SP - 223

EP - 229

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Combinatorial Problems on H-graphs

Abstract

Access to Document

Fingerprint

Research output

On H-Topological Intersection Graphs

Combinatorial Problems on $H$-graphs

Cite this