P. Haxell

activity

20142026

most citedMorphing Planar Graph Drawings with Unidirectional Moves

11 citations · 38 across the 16 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 8 cited

Finding Independent Transversals Efficiently

Alessandra Graf, Penny Haxell

We give an efficient algorithm that, given a graph $G$ and a partition $V_{1}, \dots, V_{m}$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots…

math.CO2018★ 1 cited

Goldberg's Conjecture is true for random multigraphs

Penny Haxell, Michael Krivelevich, Gal Kronenberg

In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph $G$ , the chromatic index $χ^{'} (G)$ satisfies $χ^{'} (G) \leq max {Δ (G) + 1, ⌈ ρ (G)⌉}$ , where…