Tree-independence number VII. Excluding a star

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chudnovsky, Maria, Czyżewska, Jadwiga, Pilipczuk, Marcin, Rzążewski, Paweł
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Excluding a clique or a biclique in graphs of bounded induced matching treewidth
by: Abrishami, Tara, et al.
Published: (2024)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
by: Bonnet, Édouard, et al.
Published: (2026)

Clique-width and induced topological minors
by: Bieliński, Paweł Rafał, et al.
Published: (2026)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
by: Czyżewska, Jadwiga, et al.
Published: (2025)

Tree independence number III. Thetas, prisms and stars
by: Chudnovsky, Maria, et al.
Published: (2024)

Constant congestion brambles in directed graphs
by: Masařík, Tomáš, et al.
Published: (2021)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Excluding the fork and antifork
by: Chudnovsky, Maria, et al.
Published: (2024)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Tree independence number II. Three-path-configurations
by: Chudnovsky, Maria, et al.
Published: (2024)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
by: Lokshtanov, Daniel, et al.
Published: (2026)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
by: Majewski, Konrad, et al.
Published: (2022)

Tree independence number I. (Even hole, diamond, pyramid)-free graphs
by: Abrishami, Tara, et al.
Published: (2023)

Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs
by: Abrishami, Tara, et al.
Published: (2023)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Counting independent sets in structured graphs
by: Bucić, Matija, et al.
Published: (2024)

Burling graphs in graphs with large chromatic number
by: Abrishami, Tara, et al.
Published: (2025)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
by: Bonnet, Édouard, et al.
Published: (2026)

Coarse Balanced Separators and Tree-Decompositions
by: Chudnovsky, Maria, et al.
Published: (2025)

Tree-independence number and forbidden induced subgraphs: excluding a $6$-vertex path and a $(2,t)$-biclique
by: Chudnovsky, Maria, et al.
Published: (2026)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Finding large $k$-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence
by: Chudnovsky, Maria, et al.
Published: (2025)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Minors of plane digraphs
by: Chudnovsky, Maria, et al.
Published: (2026)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Excluded conformal minors of Birkhoff-von Neumann graphs with equal global forcing number and maximum anti-forcing number
by: Zhang, Yaxian, et al.
Published: (2025)

The Excluded Tree Minor Theorem Revisited
by: Dujmović, Vida, et al.
Published: (2023)

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
by: Chudnovsky, Maria, et al.
Published: (2024)

The minimum number of maximal independent sets in graphs with given order and independence number
by: Tian, Yuting, et al.
Published: (2024)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
by: Bonnet, Édouard, et al.
Published: (2024)