M. Ferrara

activity

20112020

most citedFlexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four

5 citations · 17 across the 12 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

Chvátal-type results for degree sequence Ramsey numbers

Christopher Cox, Michael Ferrara, Ryan M. Martin +1

A sequence of nonnegative integers $π = (d_{1}, d_{2}, ..., d_{n})$ is graphic if there is a (simple) graph $G$ of order $n$ having degree sequence $π$ . In this case, $G$ is said to realize o…

math.CO2015

I,F-partitions of Sparse Graphs

Axel Brandt, Michael Ferrara, Mohit Kumbhat +3

A star $k$ -coloring is a proper $k$ -coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-c…

math.CO2015★ 4 cited

On the Strong Chromatic Index of Sparse Graphs

Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7

The strong chromatic index of a graph $G$ , denoted $χ_{s}^{'} (G)$ , is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors.…