Boncompagni, V, Penev, I and Vuskovic, K (2017) Clique cutsets beyond chordal graphs. In: Electronic Notes in Discrete Mathematics. IX Latin and American Algorithms, Graphs and Optimization Sympoisium, 11-15 Sep 2017, Marseille, France. Elsevier , pp. 81-86.
Abstract
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. We also obtain polynomial χ-bounding functions for these classes.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 Published by Elsevier B.V. This is an author produced version of a paper published in Electronic Notes in Discrete Mathematics. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | clique; stable set; vertex coloring; structure; algorithms |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/K016423/1 EPSRC EP/N019660/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 Jul 2017 11:11 |
Last Modified: | 26 Oct 2018 00:49 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.endm.2017.10.015 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:119047 |