Cover Image

An Overview of Universal Obstructions for Graph Parameters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Paul, Christophe, Protopapas, Evangelos, Thilikos, Dimitrios M.
Format:	Preprint
Published:	2023
Subjects:	Discrete Mathematics Combinatorics 05C85, 05C83, 05C75 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Colorful Minors
by: Protopapas, Evangelos, et al.
Published: (2025)

On Strict Brambles
by: Lardas, Emmanouil, et al.
Published: (2022)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

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

Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)

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

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

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

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)

(Even hole, triangle)-free graphs revisited
by: Martins, Beatriz, et al.
Published: (2026)

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

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

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

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

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

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

Vertex identification to a forest
by: Morelle, Laure, et al.
Published: (2024)

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

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

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

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

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

Coloring Graphs With No Totally Odd Clique Immersion
by: McFarland, Caleb
Published: (2025)

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

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

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)

On the Boxicity of Line Graphs and of Their Complements
by: Caoduro, Marco, et al.
Published: (2025)

Open Packing in Graphs: Bounds and Complexity
by: Shalu, M. A., et al.
Published: (2024)

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

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

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

Graphs with core(G) = nucleus(G)
by: Levit, Vadim E., et al.
Published: (2026)

Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)

Every Graph is Essential to Large Treewidth
by: Alecu, Bogdan, et al.
Published: (2025)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Graphs whose Eulerian trails have unique labels
by: Kim, Donggyu, et al.
Published: (2026)

Computing a 3-role assignment is polynomial-time solvable on complementary prisms
by: Castonguay, Diane, et al.
Published: (2024)