| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903494 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Valerio Boncompagni, Irena Penev, Kristina VuÅ¡koviÄ,