11 citations · 11 across the 5 of their papers we have counts for
5 papers
Partial independent transversals in multipartite graphs
Penny Haxell, Arpit Mittal, Yi Zhao
Given integers and an -partite graph, an independent -transversal or -IT is an independent set of size that intersects each part in at most one ve…
Density of -critical signed graphs
Laurent Beaudou, Penny Haxell, Kathryn Nurse +2
We say that a signed graph is -critical if it is not -colorable but every one of its proper subgraphs is -colorable. Using the definition of colorability due to Naserasr,…
Degree criteria and stability for independent transversals
Penny Haxell, Ronen Wdowinski
An \emph{independent transversal} (IT) in a graph with a given vertex partition is an independent set of vertices of (i.e. it induces no edges), that consists of one ve…
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…