Image de couverture de livre

Approximating branchwidth on parametric extensions of planarity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Thilikos, Dimitrios M., Wiederrecht, Sebastian
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Discrete Mathematics 05C83, 05C85, 05C75, 68R10, 68Q27 G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
par: Paul, Christophe, et autres
Publié: (2024)

The Local Structure Theorem for Graph Minors with finite index
par: Paul, Christophe, et autres
Publié: (2025)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

Colorful Minors
par: Protopapas, Evangelos, et autres
Publié: (2025)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
par: Gollin, J. Pascal, et autres
Publié: (2023)

Killing a Vortex
par: Thilikos, Dimitrios M., et autres
Publié: (2022)

Excluding Pinched Spheres
par: Morelle, Laure, et autres
Publié: (2025)

Quickly excluding an annotated planar graph
par: Gorsky, Maximilian, et autres
Publié: (2026)

Polynomial Bounds for the Graph Minor Structure Theorem
par: Gorsky, Maximilian, et autres
Publié: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
par: Choi, Mujin, et autres
Publié: (2025)

Excluding surfaces as minors in graphs
par: Thilikos, Dimitrios M., et autres
Publié: (2026)

Optimal Bounds for the k-Disjoint Paths Problem
par: Cavallaro, Dario, et autres
Publié: (2026)

The price of homogeneity is polynomial
par: Gorsky, Maximilian, et autres
Publié: (2026)

Obstructions to Erdős-Pósa Dualities for Minors
par: Paul, Christophe, et autres
Publié: (2024)

An Overview of Universal Obstructions for Graph Parameters
par: Paul, Christophe, et autres
Publié: (2023)

The Directed Disjoint Paths Problem with Congestion
par: Bentert, Matthias, et autres
Publié: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
par: Golovach, Petr A., et autres
Publié: (2019)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

Vertex identification to a forest
par: Morelle, Laure, et autres
Publié: (2024)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
par: Morelle, Laure, et autres
Publié: (2025)

Faster parameterized algorithms for modification problems to minor-closed classes
par: Morelle, Laure, et autres
Publié: (2022)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
par: Sau, Ignasi, et autres
Publié: (2026)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

A coarse Menger's Theorem for planar and bounded genus graphs
par: Blažej, Václav, et autres
Publié: (2026)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
par: Chudnovsky, Maria, et autres
Publié: (2024)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
par: Sau, Ignasi, et autres
Publié: (2024)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
par: Golovach, Petr A., et autres
Publié: (2022)

On Strict Brambles
par: Lardas, Emmanouil, et autres
Publié: (2022)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

A note on the structure of locally finite planar quasi-transitive graphs
par: Giocanti, Ugo
Publié: (2024)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

Graph Parameters, Universal Obstructions, and WQO
par: Paul, Christophe, et autres
Publié: (2023)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Boolean combinations of graphs
par: Adenwalla, Sarosh, et autres
Publié: (2024)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

Census Dual Graphs: Properties and Random Graph Models
par: Anderson, Sara, et autres
Publié: (2026)