11 citations · 13 across the 6 of their papers we have counts for
11 papers
How to Morph a Tree on a Small Grid
Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo +4
In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move a…
Regular and biregular planar cages
Gabriela Araujo-Pardo, Fidel Barrera-Cruz, Natalia García-Colín
We study the Cage Problem for regular and biregular planar graphs. A -graph is a -regular graph with girth . A -cage is a -graph of minimum order. It is…
Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension
Fidel Barrera-Cruz, Thomas Prag, Heather Smith +2
The original notion of dimension for posets is due to Dushnik and Miller and has been studied extensively in the literature. Quite recently, there has been considerable interest in…
Analogies between the crossing number and the tangle crossing number
Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz +8
Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of…
The Graph of Critical Pairs of a Crown
Fidel Barrera-Cruz, Rebecca Garcia, Pamela Harris +5
There is a natural way to associate with a poset a hypergraph , called the hypergraph of critical pairs, so that the dimension of is exactly equal to the chromatic numbe…
On the structure of RNA branching polytopes
Fidel Barrera-Cruz, Christine Heitsch, Svetlana Poznanović
The prevalent method for RNA secondary structure prediction for a single sequence is free energy minimization based on the nearest neighbor thermodynamic model (NNTM). One of the l…
Separating Tree-chromatic number from Path-chromatic Number
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros +4
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~ while the path-chromatic number is unbounded. This resolves a…
A Note on Schnyder's Theorem
Fidel Barrera-Cruz, Penny Haxell
We give an alternate proof of Schnyder's Theorem, that the incidence poset of a graph has dimension at most three if and only if is planar.
How to morph planar graph drawings
Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz +10
Given an -vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous tra…
Morphing Schnyder drawings of planar triangulations
Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw
We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists…
Morphing Planar Graph Drawings with Unidirectional Moves
Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw
Alamdari et al. showed that given two straight-line planar drawings of a graph, there is a morph between them that preserves planarity and consists of a polynomial number of steps…