Induced subgraphs and tree decompositions. XIII. Basic obstructions in H-free graphs for finite H

DOI10.19086/AIC.2024.6MaRDI QIDQ6989708zbMATH OpenFDO

Authors Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl

Publication date 29 April 2025

Published in Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/AIC.2024.6

zbMATH Keywords

graph minorsinduced subgraphstree decompositionstreewidth

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Cited in

(2)

• Induced subgraphs and tree decompositions. XVI: Complete bipartite induced minors
• A simple layered-wheel-like construction

This page was built for publication: Induced subgraphs and tree decompositions. XIII. Basic obstructions in \(\mathcal{H}\)-free graphs for finite \(\mathcal{H}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989708)