activity
20032023
most citedReconstructing 3-colored grids from horizontal and vertical projections is NP-hard

13 citations · 17 across the 10 of their papers we have counts for

collaborators

13 papers

math.CO2023★ 1 cited

Boundedness for proper conflict-free and odd colorings

Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7

The proper conflict-free chromatic number, , of a graph is the least such that has a proper -coloring in which for each non-isolated vertex there is a co…

math.MG2022

Lines in quasi-metric spaces with four points

Gabriela Araujo-Pardo, Martín Matamala, José Zamora

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chvátal in 2008 conjectured that the same results is true in metric spaces for a…

cs.DM2020

Graphs with no induced house nor induced hole have the de Bruijn-Erdős property

Pierre Aboulker, Laurent Beaudou, Martín Matamala +1

A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chvátal conjectured in 2008 that a similar result can be achieved in the broa…

math.CO2019

Chen and Chvátal's Conjecture in tournaments

Gabriela Araujo-Pardo, Martı'n Matamala

In this work we present a version of the so called Chen and Chvátal's conjecture for directed graphs. A line of a directed graph D is defined by an ordered pair (u, v), with u and…

math.CO2018★ 2 cited

Lines in metric spaces: universal lines counted with multiplicity

Martín Matamala, José Zamora

The line generated by two distinct points, and , in a finite metric space , denoted by , is the set of points given by $$\overline{xy}^M:=\{z\in V:…

math.CO2016

A new class of graphs that satisfies the Chen-Chvátal Conjecture

Pierre Aboulker, Martin Matamala, Paul Rochet +1

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chvátal conjectured that this theorem exten…