Imagen de Portada

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Onofri, Elia
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Combinatorics 05C75, 05C40, 68R10, 05C85
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
por: Oum, Sang-il, et al.
Publicado: (2026)

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

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

$t$-sails and sparse hereditary classes of unbounded tree-width
por: Cocks, Daniel
Publicado: (2023)

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

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

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

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

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

The Upper Clique Transversal Problem
por: Milanič, Martin, et al.
Publicado: (2023)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
por: Munaro, Andrea, et al.
Publicado: (2022)

Tree independence number V. Walls and claws
por: Chudnovsky, Maria, et al.
Publicado: (2025)

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

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
por: Galby, Esther, et al.
Publicado: (2024)

A $5/4$-Approximation for Two-Edge Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2024)

Branch-width of represented matroids in matrix multiplication time
por: Choi, Mujin, et al.
Publicado: (2026)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
por: Lima, Paloma T., et al.
Publicado: (2024)

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

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

Reconfiguration of Independent Transversals
por: Buys, Pjotr, et al.
Publicado: (2024)

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

A Simple 2-Approximation for Maximum-Leaf Spanning Tree
por: Liao, I-Cheng, et al.
Publicado: (2023)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Solving the Graph Burning Problem for Large Graphs
por: Pereira, Felipe de Carvalho, et al.
Publicado: (2024)

Optimal Adjacency Labels for Subgraphs of Cartesian Products
por: Esperet, Louis, et al.
Publicado: (2022)

Pathographs and some (un)decidability results
por: Carter, Daniel, et al.
Publicado: (2025)

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

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

Branch-width of connectivity functions is fixed-parameter tractable
por: Korhonen, Tuukka, et al.
Publicado: (2026)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
por: Hoang, Duc A.
Publicado: (2022)

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

A $4/3$ Approximation for $2$-Vertex-Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2023)

Awesome graph parameters
por: Štorgel, Kenny Bešter, et al.
Publicado: (2025)

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

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

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

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
por: Hommelsheim, Felix
Publicado: (2025)

Polynomial $χ$-boundedness for excluding $P_5$
por: Nguyen, Tung H.
Publicado: (2025)