Imagen de Portada

Obstructions to Erdős-Pósa Dualities for Minors

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Paul, Christophe, Protopapas, Evangelos, Thilikos, Dimitrios M., Wiederrecht, Sebastian
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Data Structures and Algorithms 05C83, 05C85, 05C10, 05C75, 68R10 G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
por: Paul, Christophe, et al.
Publicado: (2024)

Colorful Minors
por: Protopapas, Evangelos, et al.
Publicado: (2025)

The Local Structure Theorem for Graph Minors with finite index
por: Paul, Christophe, et al.
Publicado: (2025)

Excluding Pinched Spheres
por: Morelle, Laure, et al.
Publicado: (2025)

Excluding surfaces as minors in graphs
por: Thilikos, Dimitrios M., et al.
Publicado: (2026)

Approximating branchwidth on parametric extensions of planarity
por: Thilikos, Dimitrios M., et al.
Publicado: (2023)

Killing a Vortex
por: Thilikos, Dimitrios M., et al.
Publicado: (2022)

Optimal Bounds for the k-Disjoint Paths Problem
por: Cavallaro, Dario, et al.
Publicado: (2026)

Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)

Finding irrelevant vertices in linear time on bounded-genus graphs
por: Golovach, Petr A., et al.
Publicado: (2019)

Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
por: Morelle, Laure, et al.
Publicado: (2025)

Vertex identification to a forest
por: Morelle, Laure, et al.
Publicado: (2024)

An Overview of Universal Obstructions for Graph Parameters
por: Paul, Christophe, et al.
Publicado: (2023)

Dynamic programming on bipartite tree decompositions
por: Jaffke, Lars, et al.
Publicado: (2023)

Faster parameterized algorithms for modification problems to minor-closed classes
por: Morelle, Laure, et al.
Publicado: (2022)

Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
por: Sau, Ignasi, et al.
Publicado: (2024)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
por: Choi, Mujin, et al.
Publicado: (2025)

The price of homogeneity is polynomial
por: Gorsky, Maximilian, et al.
Publicado: (2026)

A Constant-factor Approximation for Weighted Bond Cover
por: Kim, Eun Jung, et al.
Publicado: (2021)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
por: Sau, Ignasi, et al.
Publicado: (2026)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
por: Gollin, J. Pascal, et al.
Publicado: (2023)

The Directed Disjoint Paths Problem with Congestion
por: Bentert, Matthias, et al.
Publicado: (2025)

Excluding a Forest Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2025)

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
por: Onofri, Elia
Publicado: (2024)

Graph Parameters, Universal Obstructions, and WQO
por: Paul, Christophe, et al.
Publicado: (2023)

Identification to Subclasses of Chordal Graphs
por: Golovach, Petr A., et al.
Publicado: (2026)

A coarse Menger's Theorem for planar and bounded genus graphs
por: Blažej, Václav, et al.
Publicado: (2026)

W-state graphs: Structure and Algorithms
por: Gajjala, Rishikesh, et al.
Publicado: (2026)

On Strict Brambles
por: Lardas, Emmanouil, et al.
Publicado: (2022)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
por: Atherton, William, et al.
Publicado: (2024)

Excluding an induced wheel minor in graphs without large induced stars
por: Choi, Mujin, et al.
Publicado: (2025)

A Graph Minors Approach to Temporal Sequences
por: Carmesin, Johannes, et al.
Publicado: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)

Temporalizing digraphs via linear-size balanced bi-trees
por: Bessy, Stéphane, et al.
Publicado: (2023)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
por: McFarland, Caleb
Publicado: (2026)

The Minimum Subgraph Complementation Problem
por: Gutiérrez, Juan, et al.
Publicado: (2025)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
por: Milanič, Martin, et al.
Publicado: (2024)