Image de couverture de livre

Cliquewidth and dimension

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Joret, Gwenaël, Micek, Piotr, Pilipczuk, Michał, Walczak, Bartosz
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cliquewidth and dimension
par: Gwenaël Joret, et autres
Publié: (2026)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
par: Joret, Gwenaël, et autres
Publié: (2026)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
par: Bourneuf, Romain, et autres
Publié: (2026)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)

Erdős--Pósa property of cycles that are far apart
par: Dujmović, Vida, et autres
Publié: (2024)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

The Excluded Tree Minor Theorem Revisited
par: Dujmović, Vida, et autres
Publié: (2023)

Planar graphs in blowups of fans
par: Distel, Marc, et autres
Publié: (2024)

Adjacency labelling for proper minor-closed graph classes
par: Dujmović, Vida, et autres
Publié: (2026)

Pathwidth vs cocircumference
par: Briański, Marcin, et autres
Publié: (2023)

Neighborhood complexity of planar graphs
par: Joret, Gwenaël, et autres
Publié: (2023)

A Caro-Wei bound for induced linear forests in graphs
par: Joret, Gwenaël, et autres
Publié: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

Strong odd colorings in graph classes of bounded expansion
par: Pilipczuk, Michał
Publié: (2025)

Excluding an apex-forest or a fan as quickly as possible
par: Claus, Quentin, et autres
Publié: (2026)

Polynomial-time recognition and maximum independent set in Burling graphs
par: Rzążewski, Paweł, et autres
Publié: (2024)

Improved lower bounds on the maximum size of graphs with girth 5
par: Goedgebeur, Jan, et autres
Publié: (2025)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Centered colorings and weak coloring numbers in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2026)

Quickly excluding an apex-forest
par: Hodor, Jędrzej, et autres
Publié: (2024)

Weak coloring numbers of minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2024)

Sample compression schemes for balls in structurally sparse graphs
par: Bourneuf, Romain, et autres
Publié: (2026)

Centered colorings in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2024)

Vertex Ranking of Degenerate Graphs
par: Iacono, John, et autres
Publié: (2024)

Obstructions and dualities for matroid depth parameters
par: Gajarský, Jakub, et autres
Publié: (2025)

On coarse tree decompositions and coarse balanced separators
par: Abrishami, Tara, et autres
Publié: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

Erdős-Pósa property of tripods in directed graphs
par: Briański, Marcin, et autres
Publié: (2024)

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

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
par: Chekan, Vera, et autres
Publié: (2024)

Integer programs with bounded subdeterminants and two nonzeros per row
par: Fiorini, Samuel, et autres
Publié: (2021)

Graph classes through the lens of logic
par: Pilipczuk, Michał
Publié: (2025)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

Integer programs with nearly totally unimodular matrices: the cographic case
par: Aprile, Manuel, et autres
Publié: (2024)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

Variants of Merge-Width and Applications
par: Drabik, Karolina, et autres
Publié: (2026)

Burling graphs in graphs with large chromatic number
par: Abrishami, Tara, et autres
Publié: (2025)