Tree independence number I. (Even hole, diamond, pyramid)‐free graphs

Abrishami, T., Alecu, B. orcid.org/0000-0002-5515-9145, Chudnovsky, M. et al. (3 more authors) (Cover date: August 2024) Tree independence number I. (Even hole, diamond, pyramid)‐free graphs. Journal of Graph Theory, 106 (4). pp. 923-943. ISSN: 0364-9024

Metadata

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

© 2024 The Authors. Journal of Graph Theory published by Wiley Periodicals LLC. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: algorithmic graph theory; even-hole-free graphs; structural graph theory; tree independence number; treewidth
Dates:
  • Accepted: 1 April 2024
  • Published (online): 24 April 2024
  • Published: 15 June 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Date Deposited: 12 Dec 2025 14:33
Last Modified: 12 Dec 2025 14:33
Status: Published
Publisher: Wiley
Identification Number: 10.1002/jgt.23104
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics

View Altmetric information about this item.


CORE (COnnecting REpositories)