Radovanović, M, Trotignon, N and Vuskovic, K (2021) The (theta, wheel)-free graphs Part IV: Induced paths and cycles. Journal of Combinatorial Theory: Series B, 146. pp. 495-531. ISSN 0095-8956
Abstract
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three internally vertex-disjoint paths of length at least 2 between the same pair of distinct vertices. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this series of papers we study the class of graphs that do not contain as an induced subgraph a theta nor a wheel. In Part II of the series we prove a decomposition theorem for this class, that uses clique cutsets and 2-joins. In this paper we use this decomposition theorem to solve several problems related to finding induced paths and cycles in our class.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | © 2020 Elsevier Inc. All rights reserved. This is an author produced version of an article published in Journal of Combinatorial Theory: Series B. Uploaded in accordance with the publisher's self-archiving policy. | ||||
Keywords: | Wheel; Theta; Truemper configuration; Algorithm; Induced linkage; Induced disjoint paths | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 12 Jun 2020 15:37 | ||||
Last Modified: | 07 Jul 2021 00:38 | ||||
Status: | Published | ||||
Publisher: | Elsevier | ||||
Identification Number: | https://doi.org/10.1016/j.jctb.2020.06.002 |