Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
type: Item
instance of: scholarly article
title: Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
zbMATH Open document ID: 1542.05031
author: Tara Abrishami
author: Bogdan Alecu
author: Maria Chudnovsky
author: Sepehr Hajebi
author: Sophie Spirkl
author: Kristina Vušković
published in: Journal of Graph Theory
publication date: 2024-07-02T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7874808
zbMATH Keywords: algorithmic graph theory
zbMATH Keywords: even-hole-free graphs
zbMATH Keywords: structural graph theory
zbMATH Keywords: tree independence number
zbMATH Keywords: treewidth
MaRDI profile type: Publication
cites work: Graphs with polynomially many minimal separators
cites work: Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
cites work: Safe separators for treewidth
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: Structure and algorithms for (cap, even hole)-free graphs
cites work: Even-hole-free graphs still have bisimplicial vertices
cites work: Universally signable graphs
cites work: Parameterized Algorithms
cites work: Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
cites work: Treewidth versus clique number. II: Tree-independence number
cites work: On diameters and radii of bridged graphs
cites work: Finding Induced Subgraphs via Minimal Triangulations
cites work: Parameters Tied to Treewidth
cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
cites work: Independent Set in P5-Free Graphs in Polynomial Time
cites work: Q4352948
cites work: (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
cites work: The world of hereditary graph classes viewed through Truemper configurations
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
cites work: In absence of long chordless cycles, large tree-width becomes a local phenomenon
DOI: 10.1002/JGT.23104
description: scientific article; zbMATH DE number 7874808