activity
20112023
most citedClique immersions and independence number

11 citations · 19 across the 11 of their papers we have counts for

collaborators

14 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…

math.CO2022

Marked graphs and the chromatic symmetric function

José Aliste-Prieto, Anna de Mier, Rosa Orellana +1

The main result of this paper is the introduction of marked graphs and the marked graph polynomials (-polynomial) associated with them. These polynomials can be defined via a de…

math.CO2020

A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function

José Aliste-Prieto, Logan Crew, Sophie Spirkl +1

This paper has two main parts. First, we consider the Tutte symmetric function , a generalization of the chromatic symmetric function. We introduce a vertex-weighted version of…

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.CO2020

On the smallest trees with the same restricted -polynomial and the rooted -polynomial

José Aliste-Prieto, Anna de Mier, José Zamora

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted -polynomial for every ; by this we mean that the polynomials agree o…