M. Axenovich

activity

20062026

most citedOn the editing distance of graphs

33 citations · 164 across the 61 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs

Maria Axenovich, Jonathan Rollin

A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let $f (r, Δ)$ be the smallest integ…

math.CO2014

Spectrum of mixed bi-uniform hypergraphs

Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt

A mixed hypergraph is a triple $H = (V, C, D)$ , where $V$ is a set of vertices, $C$ and $D$ are sets of hyperedges. A vertex-coloring of $H$ is…

math.CO2014

Density of Range Capturing Hypergraphs

Maria Axenovich, Torsten Ueckerdt

For a finite set $X$ of points in the plane, a set $S$ in the plane, and a positive integer $k$ , we say that a $k$ -element subset $Y$ of $X$ is captured by $S$ if there is a homoth…