11 citations · 19 across the 11 of their papers we have counts for
11 papers · 1 filter
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…
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…
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…
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…
Clique immersions and independence number
Sebastián Bustamante, Daniel A. Quiroz, Maya Stein +1
The analogue of Hadwiger's conjecture for the immersion order states that every graph contains as an immersion. If true, it would imply that every graph with ver…
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:…