:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Joret, Gwenaël, Micek, Piotr, Pilipczuk, Michał, Walczak, Bartosz
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	https://arxiv.org/abs/2308.11950
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cliquewidth and dimension
by: Gwenaël Joret, et al.
Published: (2026)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

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

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

Pathwidth vs cocircumference
by: Briański, Marcin, et al.
Published: (2023)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

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

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

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

Quickly excluding an apex-forest
by: Hodor, Jędrzej, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)

Obstructions and dualities for matroid depth parameters
by: Gajarský, Jakub, et al.
Published: (2025)

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

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

Integer programs with bounded subdeterminants and two nonzeros per row
by: Fiorini, Samuel, et al.
Published: (2021)

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

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)

Graph classes through the lens of logic
by: Pilipczuk, Michał
Published: (2025)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Variants of Merge-Width and Applications
by: Drabik, Karolina, et al.
Published: (2026)

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