Imagen de Portada

Cliquewidth and dimension

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Joret, Gwenaël, Micek, Piotr, Pilipczuk, Michał, Walczak, Bartosz
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Cliquewidth and dimension
por: Gwenaël Joret, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

Pathwidth vs cocircumference
por: Briański, Marcin, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

Vertex Ranking of Degenerate Graphs
por: Iacono, John, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Graph classes through the lens of logic
por: Pilipczuk, Michał
Publicado: (2025)

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

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

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

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

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