Abrishami, T., Alecu, B. orcid.org/0000-0002-5515-9145, Chudnovsky, M. et al. (2 more authors) (2024) Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Combinatorica, 44. pp. 921-948. ISSN 0209-9683
Abstract
Given a graph H, we prove that every (theta, prism)-free graph of sufficiently large treewidth contains either a large clique or an induced subgraph isomorphic to H, if and only if H is a forest.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Author(s), under exclusive licence to János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2024. This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s00493-024-00097-0 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
Depositing User: | Symplectic Publications |
Date Deposited: | 25 Apr 2024 14:19 |
Last Modified: | 15 Oct 2024 14:09 |
Status: | Published |
Publisher: | Springer |
Identification Number: | 10.1007/s00493-024-00097-0 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:211812 |