scientific article; zbMATH DE number 7788454

DOI10.5555/3458064.3458180arXiv2003.05185MaRDI QIDQ6147372

Maria Chudnovsky, Paul Seymour, Paweł Rzążewski, Marcin Pilipczuk, Tara Abrishami

Publication date: 15 January 2024

Full work available at URL: https://arxiv.org/abs/2003.05185

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

Treewidth versus clique number. II: Tree-independence number ⋮ Classifying subset feedback vertex set for \(H\)-free graphs ⋮ Connected feedback vertex set on AT-free graphs ⋮ Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths ⋮ Induced subgraphs of bounded treewidth and the container method

This page was built for publication:

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