11 citations · 38 across the 16 of their papers we have counts for
5 papers · 1 filter
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…
On lower bounds for the matching number of subcubic graphs
Penny Haxell, Alex Scott
We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower b…
Extremal Hypergraphs for Ryser's Conjecture: Home-Base Hypergraphs
Penny Haxell, Lothar Narins, Tibor Szabó
Ryser's Conjecture states that any -partite -uniform hypergraph has a vertex cover of size at most times the size of the largest matching. For , the conjecture…
Extremal Hypergraphs for Ryser's Conjecture: Connectedness of Line Graphs of Bipartite Graphs
Penny Haxell, Lothar Narins, Tibor Szabó
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex…