Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree

This is the latest version of this eprint.

Abrishami, T., Chudnovsky, M. orcid.org/0000-0002-8920-4944 and Vušković, K. (2022) Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. Journal of Combinatorial Theory, Series B, 157. pp. 144-175. ISSN 0095-8956

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2022 Elsevier Inc. 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: Treewidth; Even-hole-free graphs
Dates:
  • Published: November 2022
  • Published (online): 17 June 2022
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 (Engineering and Physical Sciences Research Council)
EP/V002813/1
EPSRC (Engineering and Physical Sciences Research Council)
EP/N019660/1
Depositing User: Symplectic Publications
Date Deposited: 12 Apr 2024 16:24
Last Modified: 21 Nov 2024 17:31
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.jctb.2022.05.009
Open Archives Initiative ID (OAI ID):

Available Versions of this Item

Export

Statistics