13 citations · 28 across the 11 of their papers we have counts for
13 papers
On the spectrum and expansion of graph associahedra
Ana Gargantini, Adrián Pastine, Pablo Torres +1
In this article, we contribute to the spectral analysis of graph associahedra by providing a lower bound for the second largest eigenvalue of . Furthermore, using e…
Token sliding independent set reconfiguration on graphs with few 's
Lucia Busolini, Mario Valencia-Pabon
We consider the INDEPENDENT SET RECONFIGURATION problem under the Token Sliding rule. Let be an independent set of a simple undirected graph . Suppose that each vertex of $I…
Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza +1
An elimination tree of a connected graph is a rooted tree on the vertices of obtained by choosing a root and recursing on the connected components of to obtain th…
Exact distance Kneser graphs
Agustina Victoria Ledezma, Adrián Pastine, Mario Valencia-Pabon
For any graph and positive integer , the exact distance- graph is the graph with vertex set , where two vertices are adjacent if and only if the dista…
The rotation distance of brooms
Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon
The associahedron of a graph has the property that its vertices can be thought of as the search trees on and its edges as the rotations between two search…
On restricted completions of chordal and trivially perfect graphs
Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon
Let be a graph having a vertex such that is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…