Tree independence number. II: Three-path-configurations

DOI10.1016/J.JCTB.2025.08.003MaRDI QIDQ6862423zbMATH OpenFDO

Authors Maria Chudnovsky, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl

Publication date 9 February 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

treewidthinduced subgraphtree independence numberthree-path-configurations

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Tree independence number. II: Three-path-configurations

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