Ignacio Maqueda

collaborators

2 papers

cs.DM2026

Removing bottlenecks in the recognition of small $(k, ℓ)$ -graph classes

Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda

A graph is a $(k, ℓ)$ -graph if its vertex set can be partitioned into $k$ independent sets and $ℓ$ cliques. This family simultaneously generalizes split, bipartite, and co-bip…

math.CO2025

Trees with proper thinness 2

Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal

The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with pro…

Removing bottlenecks in the recognition of small (k,ℓ)-graph classes

Trees with proper thinness 2

Removing bottlenecks in the recognition of small $(k, ℓ)$ -graph classes