Michael Ferrara

According to our database1, Michael Ferrara authored at least 53 papers between 2006 and 2022.

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



In proceedings 
PhD thesis 


On csauthors.net:


Flexibility of planar graphs - Sharpening the tools to get lists of size four.
Discret. Appl. Math., 2022

Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs.
Discret. Math., 2021

Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
J. Graph Theory, 2020

List-distinguishing Cartesian products of cliques.
Discret. Math., 2019

Navigating between packings of graphic sequences.
Discret. Appl. Math., 2019

Stability of the Potential Function.
SIAM J. Discret. Math., 2018

Extending precolorings to distinguish group actions.
Eur. J. Comb., 2018

On the Strong Chromatic Index of Sparse Graphs.
Electron. J. Comb., 2018

Colored Saturation Parameters for Rainbow Subgraphs.
J. Graph Theory, 2017

The saturation number of induced subposets of the Boolean lattice.
Discret. Math., 2017

Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016

I, F-partitions of sparse graphs.
Eur. J. Comb., 2016

On the sum necessary to ensure that a degree sequence is potentially H-graphic.
Comb., 2016

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem.
SIAM J. Discret. Math., 2015

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs.
Graphs Comb., 2015

Degree Conditions for Spanning Brooms.
J. Graph Theory, 2014

A Degree Sequence Variant of Graph Ramsey Numbers.
Graphs Comb., 2014

Ramsey-minimal saturation numbers for matchings.
Discret. Math., 2014

On 2-factors with a bounded number of odd components.
Discret. Math., 2014

Improved degree conditions for 2-factors with k cycles in hamiltonian graphs.
Discret. Math., 2014

Conditions for families of disjoint <i>k</i>-connected subgraphs in a graph.
Discret. Math., 2013

Pancyclicity of 4-connected {claw, generalized bull}-free graphs.
Discret. Math., 2013

List distinguishing parameters of trees.
Discret. Appl. Math., 2013

Degree Conditions for <i>H</i>-Linked Digraphs.
Comb. Probab. Comput., 2013

New Results on Degree Sequences of Uniform Hypergraphs.
Electron. J. Comb., 2013

A Fan-type degree condition for k-linked graphs.
Australas. J Comb., 2013

Analysis of in situ monitored thermal cycling benefits for wireless packaging early reliability evaluation.
Microelectron. Reliab., 2012

Systematic selection of cluster heads for data collection.
J. Netw. Comput. Appl., 2012

Pancyclicity of 4-Connected, Claw-Free, <i>P</i>10-Free Graphs.
J. Graph Theory, 2012

Saturation numbers for families of graph subdivisions.
J. Graph Theory, 2012

New Ore-Type Conditions for <i>H</i>-Linked Graphs.
J. Graph Theory, 2012

Packing of graphic <i>n</i>-tuples.
J. Graph Theory, 2012

Characterizing degree-sum maximal nonhamiltonian bipartite graphs.
Discret. Math., 2012

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs.
Electron. J. Comb., 2012

List-Distinguishing Colorings of Graphs.
Electron. J. Comb., 2011

Pan-<i>H</i>-Linked Graphs.
Graphs Comb., 2010

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum.
Graphs Comb., 2010

The game of F-saturator.
Discret. Appl. Math., 2010

An iterative approach to graph irregularity strength.
Discret. Appl. Math., 2010

Hamiltonian cycles avoiding sets of edges in a graph.
Australas. J Comb., 2010

A General Lower Bound for Potentially H-Graphic Sequences.
SIAM J. Discret. Math., 2009

Potentially <i>H</i>-bigraphic sequences.
Discuss. Math. Graph Theory, 2009

deBruijn-like sequences and the irregular chromatic number of paths and cycles.
Discret. Math., 2009

Disjoint hamiltonian cycles in bipartite graphs.
Discret. Math., 2009

tK<sub>p</sub>-saturated graphs of minimum size.
Discret. Math., 2009

On <i>H</i>-immersions.
J. Graph Theory, 2008

Graphic sequences with a realization containing a complete multipartite subgraph.
Discret. Math., 2008

Graphic Sequences with a Realization Containing a Union of Cliques.
Graphs Comb., 2007

An Erdös-Stone Type Conjecture for Graphic Sequences.
Electron. Notes Discret. Math., 2007

The structure and existence of 2-factors in iterated line graphs.
Discuss. Math. Graph Theory, 2007

Generalizing D-graphs.
Discret. Appl. Math., 2007

Graphic Sequences with a Realization Containing a Friendship Graph.
Ars Comb., 2007

On <i>H</i>-Linked Graphs.
Graphs Comb., 2006