Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/212
Title: | The (theta, wheel)-free graphs Part IV: Induced paths and cycles | Authors: | Radovanović, Marko Trotignon, Nicolas Vušković, Kristina |
Affiliations: | Algebra and Mathematical Logic | Keywords: | Algorithm;Induced disjoint paths;Induced linkage;Theta;Truemper configuration;Wheel | Issue Date: | 1-Jan-2021 | Rank: | M21 | Journal: | Journal of Combinatorial Theory. Series B | 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/212 | ISSN: | 00958956 | DOI: | 10.1016/j.jctb.2020.06.002 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
6
checked on Dec 20, 2024
Page view(s)
22
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.