Penny E. Haxell

According to our database1, Penny E. Haxell authored at least 64 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Goldberg's conjecture is true for random multigraphs.
J. Comb. Theory, Ser. B, 2019

Algorithms for weighted independent transversals and strong colouring.
CoRR, 2019

Extremal hypergraphs for Ryser's Conjecture.
J. Comb. Theory, Ser. A, 2018

Ramsey-nice families of graphs.
Eur. J. Comb., 2018

A Stability Theorem for Matchings in Tripartite 3-Graphs.
Combinatorics, Probability & Computing, 2018

Finding Independent Transversals Efficiently.
CoRR, 2018

How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

On Lower Bounds for the Matching Number of Subcubic Graphs.
Journal of Graph Theory, 2017

Homological connectedness of random hypergraphs.
Electronic Notes in Discrete Mathematics, 2017

A Note on Intersecting Hypergraphs with Large Cover Number.
Electr. J. Comb., 2017

How to morph planar graph drawings.
CoRR, 2016

Edge coloring multigraphs without small dense subsets.
Discrete Mathematics, 2015

Morphing Schnyder drawings of planar triangulations.
CoRR, 2014

Morphing Planar Graph Drawings with Unidirectional Moves.
CoRR, 2014

Morphing Schnyder Drawings of Planar Triangulations.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Packing and covering tetrahedra.
Discrete Applied Mathematics, 2013

On characterizing Vizing's edge colouring bound.
Journal of Graph Theory, 2012

Bounded transversals in multipartite graphs.
Journal of Graph Theory, 2012

Packing and Covering Triangles in K 4-free Planar Graphs.
Graphs and Combinatorics, 2012

A stability theorem on fractional covering of triangles by edges.
Eur. J. Comb., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

On Ryser's conjecture.
Electr. J. Comb., 2012

On Forming Committees.
The American Mathematical Monthly, 2011

A Note on Schnyder's Theorem.
Order, 2011

On the Stable Paths Problem.
SIAM J. Discrete Math., 2010

List Coloring Hypergraphs.
Electr. J. Comb., 2010

Packing and Covering Triangles in Planar Graphs.
Graphs and Combinatorics, 2009

Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discrete Mathematics, 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability & Computing, 2009

An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput., 2008

Maximum acyclic and fragmented sets in regular graphs.
Journal of Graph Theory, 2008

An improved bound for the strong chromatic number.
Journal of Graph Theory, 2008

A fractional model of the border gateway protocol (BGP).
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Independent dominating sets and hamiltonian cycles.
Journal of Graph Theory, 2007

On Directed Triangles in Digraphs.
Electr. J. Comb., 2007

The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A, 2006

Odd Independent Transversals are Odd.
Combinatorics, Probability & Computing, 2006

A note on the Size-Ramsey number of long subdivisions of graphs.
ITA, 2005

An Algorithmic Version of the Hypergraph Regularity Method.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B, 2004

On the Strong Chromatic Number.
Combinatorics, Probability & Computing, 2004

Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms, 2003

Bounded size components--partitions and transversals.
J. Comb. Theory, Ser. B, 2003

On characterizing hypergraph regularity.
Random Struct. Algorithms, 2002

A Note on Cycle Lengths in Graphs.
Graphs and Combinatorics, 2002

Ramsey Numbers for Trees of Small Maximum Degree.
Combinatorica, 2002

Wide-Sense Nonblocking WDM Cross-Connects.
Proceedings of the Algorithms, 2002

Tree embeddings.
Journal of Graph Theory, 2001

Integer and Fractional Packings in Dense Graphs.
Combinatorica, 2001

Hall's theorem for hypergraphs.
Journal of Graph Theory, 2000

Embedding trees into graphs of large girth.
Discrete Mathematics, 2000

Packing and covering triangles in graphs.
Discrete Mathematics, 1999

Packing and Covering Triangles in Tripartite Graphs.
Graphs and Combinatorics, 1998

Hypercubes and Multicommodity Flows.
SIAM J. Discrete Math., 1997

Partitioning Complete Bipartite Graphs by Monochromatic Cycles, .
J. Comb. Theory, Ser. B, 1997

On Defect Sets in Bipartite Graphs (Extended Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B, 1996

Atoms of set systems with a fixed number of pairwise unions.
Discrete Mathematics, 1996

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Combinatorica, 1996

On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms, 1995

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B, 1995

A condition for matchability in hypergraphs.
Graphs and Combinatorics, 1995

A note on a conjecture of Gallai.
Graphs and Combinatorics, 1995

The Induced Size-Ramsey Number of Cycles.
Combinatorics, Probability & Computing, 1995