On H-Linked Graphs. - Michael Ferrara; Ronald J. Gould; Gerard Tansey; Thor Whalen (Graphs Comb., 2006)

Graphic Sequences with a Realization Containing a Friendship Graph. - Michael Ferrara; Ronald J. Gould; John R. Schmitt (Ars Comb., 2007)

Generalizing D-graphs. - Arthur H. Busch; Michael Ferrara; Nathan Kahl (Discret. Appl. Math., 2007)

The structure and existence of 2-factors in iterated line graphs. - Michael J. Ferrara; Ronald J. Gould; Stephen G. Hartke (Discuss. Math. Graph Theory, 2007)

An Erdös-Stone Type Conjecture for Graphic Sequences. - John R. Schmitt; Michael Ferrara (Electron. Notes Discret. Math., 2007)

Graphic Sequences with a Realization Containing a Union of Cliques. - Michael Ferrara (Graphs Comb., 2007)

Graphic sequences with a realization containing a complete multipartite subgraph. - Guantao Chen; Michael Ferrara; Ronald J. Gould; John R. Schmitt (Discret. Math., 2008)

On H-immersions. - Michael Ferrara; Ronald J. Gould; Gerard Tansey; Thor Whalen (J. Graph Theory, 2008)

tKp-saturated graphs of minimum size. - Ralph J. Faudree; Michael Ferrara; Ronald J. Gould; Michael S. Jacobson (Discret. Math., 2009)

Disjoint hamiltonian cycles in bipartite graphs. - Michael Ferrara; Ronald J. Gould; Gerard Tansey; Thor Whalen (Discret. Math., 2009)

deBruijn-like sequences and the irregular chromatic number of paths and cycles. - Michael Ferrara; Christine Lee; Phil Wallis; Ellen Gethner (Discret. Math., 2009)

Potentially H-bigraphic sequences. - Michael J. Ferrara; Michael S. Jacobson; John R. Schmitt; Mark H. Siggers (Discuss. Math. Graph Theory, 2009)

A General Lower Bound for Potentially H-Graphic Sequences. - Michael Ferrara; John R. Schmitt (SIAM J. Discret. Math., 2009)

Hamiltonian cycles avoiding sets of edges in a graph. - Michael J. Ferrara; Michael S. Jacobson; Angela K. Harlan (Australas. J Comb., 2010)

An iterative approach to graph irregularity strength. - Michael Ferrara; Ronald J. Gould; Michal Karonski; Florian Pfender (Discret. Appl. Math., 2010)

The game of F-saturator. - Michael Ferrara; Michael S. Jacobson; Angela Harris (Discret. Appl. Math., 2010)

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum. - Michael Ferrara; Michael S. Jacobson; Angela Harris (Graphs Comb., 2010)

Pan-H-Linked Graphs. - Michael Ferrara; Colton Magnant; Jeffrey S. Powell (Graphs Comb., 2010)

List-Distinguishing Colorings of Graphs. - Michael Ferrara; Breeann Flesch; Ellen Gethner (Electron. J. Comb., 2011)

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs. - Jennifer Diemunsch; Michael Ferrara; Allan Lo; Casey Moffatt; Florian Pfender; Paul S. Wenger (Electron. J. Comb., 2012)

Characterizing degree-sum maximal nonhamiltonian bipartite graphs. - Michael Ferrara; Michael S. Jacobson; Jeffrey S. Powell (Discret. Math., 2012)

Packing of graphic n-tuples. - Arthur H. Busch; Michael J. Ferrara; Stephen G. Hartke; Michael S. Jacobson; Hemanshu Kaul; Douglas B. West (J. Graph Theory, 2012)

New Ore-Type Conditions for H-Linked Graphs. - Michael Ferrara; Ronald J. Gould; Michael S. Jacobson; Florian Pfender; Jeffrey S. Powell; Thor Whalen (J. Graph Theory, 2012)

Saturation numbers for families of graph subdivisions. - Michael Ferrara; Michael S. Jacobson; Kevin G. Milans; Craig Tennenhouse; Paul S. Wenger (J. Graph Theory, 2012)

Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs. - Michael Ferrara; Timothy Morris; Paul S. Wenger (J. Graph Theory, 2012)

Systematic selection of cluster heads for data collection. - Kranthi K. Mamidisetty; Michael J. Ferrara; Shivakumar Sastry (J. Netw. Comput. Appl., 2012)

Analysis of in situ monitored thermal cycling benefits for wireless packaging early reliability evaluation. - Michael Ferrara; Michael Stephens; Leslie Marchut; Chris Yang; Ventony Fryar; Preston Scott (Microelectron. Reliab., 2012)

A Fan-type degree condition for k-linked graphs. - Ruijuan Li; Michael Ferrara; Xinhong Zhang; Shengjia Li (Australas. J Comb., 2013)

New Results on Degree Sequences of Uniform Hypergraphs. - Sarah Behrens; Catherine Erbes; Michael Ferrara; Stephen G. Hartke; Benjamin Reiniger; Hannah Spinoza; Charles Tomlinson (Electron. J. Comb., 2013)

Degree Conditions for H-Linked Digraphs. - Michael Ferrara; Michael S. Jacobson; Florian Pfender (Comb. Probab. Comput., 2013)

List distinguishing parameters of trees. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Discret. Appl. Math., 2013)

Pancyclicity of 4-connected {claw, generalized bull}-free graphs. - Michael Ferrara; Silke Gehrke; Ronald J. Gould; Colton Magnant; Jeffrey S. Powell (Discret. Math., 2013)

Conditions for families of disjoint k-connected subgraphs in a graph. - Michael Ferrara; Colton Magnant; Paul S. Wenger (Discret. Math., 2013)

Improved degree conditions for 2-factors with k cycles in hamiltonian graphs. - Louis DeBiasio; Michael Ferrara; Timothy Morris (Discret. Math., 2014)

On 2-factors with a bounded number of odd components. - Jennifer Diemunsch; Michael Ferrara; Samantha Graffeo; Timothy Morris (Discret. Math., 2014)

Ramsey-minimal saturation numbers for matchings. - Michael Ferrara; Jaehoon Kim; Elyse Yeager (Discret. Math., 2014)

A Degree Sequence Variant of Graph Ramsey Numbers. - Arthur H. Busch; Michael Ferrara; Stephen G. Hartke; Michael S. Jacobson (Graphs Comb., 2014)

Degree Conditions for Spanning Brooms. - Guantao Chen; Michael Ferrara; Zhiquan Hu; Michael S. Jacobson; Huiqing Liu (J. Graph Theory, 2014)

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs. - Andrzej Dudek; Michael Ferrara (Graphs Comb., 2015)

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem. - Jennifer Diemunsch; Michael Ferrara; Sogol Jahanbekam; James M. Shook (SIAM J. Discret. Math., 2015)

On the sum necessary to ensure that a degree sequence is potentially H-graphic. - Michael J. Ferrara; Timothy D. LeSaulnier; Casey Moffatt; Paul S. Wenger (Comb., 2016)

I, F-partitions of sparse graphs. - Axel Brandt; Michael Ferrara; Mohit Kumbhat; Sarah Loeb; Derrick Stolee; Matthew P. Yancey (Eur. J. Comb., 2016)

Partitioning a Graph into Highly Connected Subgraphs. - Valentin Borozan; Michael Ferrara; Shinya Fujita 001; Michitaka Furuya; Yannis Manoussakis; Narayanan Narayanan; Derrick Stolee (J. Graph Theory, 2016)

The saturation number of induced subposets of the Boolean lattice. - Michael Ferrara; Bill Kay; Lucas Kramer; Ryan R. Martin; Benjamin Reiniger; Heather C. Smith; Eric Sullivan (Discret. Math., 2017)

Colored Saturation Parameters for Rainbow Subgraphs. - Michael D. Barrus; Michael Ferrara; Jennifer Vandenbussche; Paul S. Wenger (J. Graph Theory, 2017)

On the Strong Chromatic Index of Sparse Graphs. - Philip DeOrsey; Michael Ferrara; Nathan Graber; Stephen G. Hartke; Luke L. Nelsen; Eric Sullivan; Sogol Jahanbekam; Bernard Lidický; Derrick Stolee; Jennifer White (Electron. J. Comb., 2018)

Extending precolorings to distinguish group actions. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Eur. J. Comb., 2018)

Stability of the Potential Function. - Catherine Erbes; Michael Ferrara; Ryan R. Martin; Paul S. Wenger (SIAM J. Discret. Math., 2018)

Navigating between packings of graphic sequences. - Péter L. Erdös; Michael Ferrara; Stephen G. Hartke (Discret. Appl. Math., 2019)

List-distinguishing Cartesian products of cliques. - Michael Ferrara; Zoltán Füredi; Sogol Jahanbekam; Paul S. Wenger (Discret. Math., 2019)

Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. - Michael Dairyko; Michael Ferrara; Bernard Lidický; Ryan R. Martin; Florian Pfender; Andrew J. Uzzell (J. Graph Theory, 2020)

Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs. - James M. Carraher; Michael Ferrara; Timothy Morris; Michael Santana (Discret. Math., 2021)

Flexibility of planar graphs - Sharpening the tools to get lists of size four. - Ilkyoo Choi; Felix Christian Clemen; Michael Ferrara; Paul Horn; Fuhong Ma; Tomás Masarík (Discret. Appl. Math., 2022)