Cover Image

Tree-independence number of $P_5$-free graphs with no large bicliques

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blažej, Václav, Gollin, J. Pascal, Hons, Tomáš, Masařík, Tomáš, Milanič, Martin, Rzążewski, Paweł, Suchý, Ondřej, Wesolek, Alexandra
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, 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)

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

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

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

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

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

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)

Single-conflict colorings of degenerate graphs
by: Bradshaw, Peter, et al.
Published: (2021)

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

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Clique-Width: Harnessing the Power of Atoms
by: Dabrowski, Konrad K., et al.
Published: (2020)

Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)

Dominated balanced separators in wheel-induced-minor-free graphs
by: Chudnovsky, Maria, et al.
Published: (2025)

Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

The Phase Transition of Discrepancy in Random Hypergraphs
by: MacRury, Calum, et al.
Published: (2021)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Nucleation-free independent graphs with implied nonedges
by: Cheng, Jialong, et al.
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

Secure domination in $P_5$-free graphs
by: Gupta, Uttam K., et al.
Published: (2025)

A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)

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

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Path Eccentricity and Forbidden Induced Subgraphs
by: Cichacz, Sylwia, et al.
Published: (2025)

On Approximate MMS Allocations on Restricted Graph Classes
by: Blažej, Václav, et al.
Published: (2025)

Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
by: Jaworska, Justyna, et al.
Published: (2025)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)

On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

On Computational Aspects of Cores of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)

Minimal toughness in subclasses of weakly chordal graphs
by: Gollin, J. Pascal, et al.
Published: (2026)

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
by: Angeliya, C. U., et al.
Published: (2025)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Structural convergence and algebraic roots
by: Hartman, David, et al.
Published: (2023)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)

Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)