Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
From MaRDI portal
Publication:6565817
DOI10.1002/JGT.23104zbMATH Open1542.05031MaRDI QIDQ6565817
Kristina Vušković, Tara Abrishami, Sepehr Hajebi, Bogdan Alecu, Maria Chudnovsky, Sophie Spirkl
Publication date: 2 July 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
treewidthalgorithmic graph theorystructural graph theoryeven-hole-free graphstree independence number
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Safe separators for treewidth
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- On diameters and radii of bridged graphs
- A bound on the chromatic number of graphs without certain induced subgraphs
- Universally signable graphs
- Listing all potential maximal cliques of a graph
- Structure and algorithms for (cap, even hole)-free graphs
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Graphs with polynomially many minimal separators
- Treewidth and minimum fill-in: Grouping the minimal separators
- The world of hereditary graph classes viewed through Truemper configurations
- Parameters Tied to Treewidth
- Finding Induced Subgraphs via Minimal Triangulations
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
- Independent Set in P5-Free Graphs in Polynomial Time
- Parameterized Algorithms
- Even-hole-free graphs still have bisimplicial vertices
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
- Treewidth versus clique number. II: Tree-independence number
This page was built for publication: Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565817)
