# Mike Ferrara's Publications

## Submitted Papers

- M. Ferrara, E. Gethner, S. Hartke, D. Stolee and P. Wenger,
__Extending Precolorings to Distinguish Group Actions__. - V. Borozan, M. Ferrara, S. Fujita, M. Furuya, Y. Manoussakis, N. N. and D. Stolee,
__Partitioning a Graph into Highly Connected Subgraphs__. - C. Erbes, M. Ferrara, R. Martin and P. Wenger,
__On the Approximate Shape of Degree Sequences that are not Potentially__.*H*-graphic - M. Ferrara, M. Jacobson, F. Pfender and P. Wenger,
__Graph Saturation in Multipartite Graphs__. - M. Ferrara, T. LeSaulnier, C. Moffatt and P. Wenger,
__On the Sum Necessary to Ensure that a Degree Sequence is Potentially__.*H*-graphic

## Accepted for Publication

- G. Chen, M. Ferrara, Z. Hu, M. Jacobson and H. Liu,
__Degree Conditions for Spanning Brooms__, to appear in*J. Graph Theory*. - A. Dudek and M. Ferrara,
__Extensions of results on rainbow Hamilton cycles in uniform hypergraphs__, to appear in*Graphs Comb*.

## Refereed Journal Papers

- A. Busch, M. Ferrara, S. Hartke and M. Jacobson,
__Ramsey-Type Numbers for Degree Sequences__,*Graphs Comb.***30**(2014), 847-859. - J. Diemunsch, M. Ferrara, S. Graffeo and T. Morris,
__On 2-factors with a bounded number of odd components__,*Discrete Math.***323**(2014), 35-42. - M. Ferrara, J. Kim and E. Yeager,
__Ramsey-minimal Saturation Numbers for Matchings__,*Discrete Math.***322**(2014), 26-30. - L. DeBiasio, M. Ferrara and T. Morris,
__Improved degree conditions for 2-factors with__,*k*cycles in hamiltonian graphs*Discrete Math.***320**(2014), 51-54.

## 2013

- S. Behrens, C. Erbes, M. Ferrara, S. Hartke, B. Reiniger, H. Spinoza and C. Tomlinson,
__New Results on Degree Sequences of Uniform Hypergraphs__,*Elec. J. Combin.***20**(4) (2013), P14, 18pp. - R. Li, M. Ferrara, X. Zhang and S. Li,
__A Fan-type Degree Condition for__,*k*-Linked Graphs*Australasian J. Comb.***57**(2013), 139-143. - M. Ferrara, M. Jacobson and F. Pfender,
__Degree Conditions for__,*H*-linked Digraphs*Combin. Probab. Comput***22**(2013), 684-699. - M. Ferrara,
__Some Problems on Graphic Sequences__,*Graph Theory Notes of New York***64**(2013), 19-25.*(Invited paper in honor of Charles Suffel his 70th birthday)*. - M. Ferrara, E. Gethner, S. Hartke, D. Stolee and P. Wenger,
__List Distinguishing Parameters of Trees__,*Discrete Applied Math.***161**(2013), 864-869. - M. Ferrara, C. Magnant and P. Wenger,
__Conditions for Families of Disjoint__,*k*-connected Subgraphs in a Graph*Discrete Math.***313**(2013), 760-764. - M. Ferrara, S. Gerkhe, R. Gould, C. Magnant and J. Powell,
__Pancyclicity of 4-connected, {claw, generalized-bull}-free graphs__,*Discrete Math.***313**(2013), 460-467. - M. Ferrara, T. Morris and P. Wenger,
__Pancyclicity of 4-Connected, Claw-free,__,*P*-free Graphs_{10}*J. Graph Theory***71**(2012), 435-447. - M. Ferrara, M. Jacobson, K. Milans, C. Tennenhouse and P. Wenger,
__Saturation Numbers for Families of Graph Subdivisions__,*J. Graph Theory***71**(2012), 416-434. - C. Clemons, J. Cossey, M. Ferrara, S. Forcey, T. Norfolk, G. Obeng, D. Ricciardi and G. Young,
__When Does Compromise Prevent More Pollution?__,*Notices Amer. Math Soc.***59**(9), (2012), 1223-1234. - M. Ferrara, R. Gould, M. Jacobson, F. Pfender, J. Powell and T. Whalen,
__New Ore-Type Conditions for__,*H*-Linked Graphs*J. Graph Theory***71**(2012), 69-77. - K. Mamidisetty, M. Ferrara and S. Sastry,
__Systematic Selection of Cluster Heads for Data Collection__,*J. Network and Computer Applications,***35**(2012), 1548-1558. - J. Diemunsch, M. Ferrara, A. Lo, C. Moffatt, F. Pfender and P. Wenger,
__Rainbow Matchings of Size__,*δ(G)*in Properly Edge-Colored Graphs*Elec. J. Combin.***19**(2) (2012), P52, 11pp. - A. Busch, M. Ferrara, S. Hartke, M. Jacobson, H. Kaul and D. West,
__Packing of Graphic__,*n*-tuples*J. Graph Theory***70**(2012), 29-39. - M. Ferrara, M. Jacobson and J. Powell,
__Characterizing Degree-Sum Maximial Nonhamiltonian Bipartite Graphs__,*Discrete Math.***312**(2012), 459-461. - G. Chen, M. Ferrara, R. Gould, C. Magnant and J. Schmitt,
__Saturation Numbers for Families of Ramsey-minimal Graphs__,*J. Combinatorics***2**(2011), 435-455. - M. Ferrara, B. Flesch and E. Gethner,
__List-Distinguishing Colorings of Graphs__,*Elec. J. Combin.***18**(2011), P161, 17pp. - E. McGough, C. Clemons, M. Ferrara, T. Norfolk, G. Young,
__A Game-Theoretic Approach to Personnel Decisions in American Football__,*J. Quant. Anal. Sports*,**6**(2010), Issue 4, Article 1, 15pp. - M. Ferrara, A. Harris and M. Jacobson,
__Hamiltonian Cycles Avoiding Sets of Edges in a Graph__,*Australasian J. Comb***48**(2010), 191-203. - M. Ferrara, R. Gould, M. Karonski and F. Pfender,
__An Iterative Approach to Graph Irregularity Strength__,*Discrete Applied Math.***158**(2010), 1189-1194. - M. Ferrara, A. Harris and M. Jacobson,
__Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum__,*Graphs Comb*.**26**(2010), 215-223. - M. Ferrara, C. Magnant and J. Powell,
__Pan-__,*H*-Linked Graphs*Graphs Comb.***26**(2010), 225-242. - M. Ferrara, A. Harris and M. Jacobson,
__The Game of__,*F*-saturator*Discrete Applied Math.***158**(2010), 189-197. - M. Ferrara, M. Jacobson, J. Schmitt, M. Siggers,
__Potentially__,*H*-Bigraphic Sequences*Discuss. Math. Graph Theory.***29**(2009), 583-596. - M. Ferrara, E. Gethner, C. Lee and P. Wallis,
__DeBruijn-Like Sequences and the Irregular Chromatic Number of Paths and Cycles__,*Discrete Math.***309**(2009), 6074-6080. - R. Faudree, M. Ferrara, R. Gould and M. Jacobson,
,*tKp*-saturated Graphs of Minimum Size*Discrete Math.***309**(2009), 5870-5876. - M. Ferrara, J. Gilbert, M. Jacobson and T. Whalen,
__Irregularity Strength of Digraphs__,*Discrete Math.***309**(2009), 5834-5840. - M. Ferrara, R. Gould, G. Tansey and T. Whalen,
__Disjoint Hamiltonian Cycles in Bipartite Graphs__,*Discrete Math.***309**(2009), 3811-3820. - M. Ferrara and J. Schmitt,
__A General Lower Bound for Potentially__,*H*-Graphic Sequences*SIAM J. Discrete Math.***23**(2009), 517-526. - M. Ferrara, R. Gould and J. Schmitt,
__Using Edge Exchanges to Prove the Erdos-Jacobson-Lehel Conjecture__,*Bulletin of the ICA***56**(2009), 73-80. - G. Chen, M. Ferrara, R. Gould and J.
Schmitt,
__Graphic Sequences with a Realization Containing a Complete Multipartite Subgraph__,*Discrete Math*,**308**(2008), 5712-5721. - M. Ferrara, R. Gould, G. Tansey and T.
Whalen,
__On__,*H*-Immersions*J. Graph Theory***57**(2008), 245-254. - M. Ferrara, R. Gould and S. Hartke,
__The Structure and Existence of__,*2*-Factors in Iterated Line Graphs*Discuss. Math. Graph Theory***27**(2007), 507-526. - A. Busch, M. Ferrara and N. Kahl,
__Generalizing__,*D*-Graphs*Discrete Applied Math***155**(2007), 2487-2495. - M. Ferrara, R. Gould and J. Schmitt,
__Graphic Sequences with a Realization Containing a Friendship Graph__,*Ars Combin.***85**(2007), 161-171. - M. Ferrara,
__Graphic Sequences with a Realization Containing a Union of Arbitrary Cliques__,*Graphs Comb.***23**(2007), 263-269. - M. Ferrara, R. Gould, G. Tansey and
T. Whalen,
__On__,*H*-Linked Graphs*Graphs Comb.***22**(2006), 217-224. - M. Ferrara, V. Rodl and Y. Kohayakawa, Distance Graphs on the Integers,
*Combin. Probab. Comput.***14**(2005), 107-131.

## 2014

## 2012

## 2011

## 2010

## 2009

## 2008

## 2007

## Pre-2007

## Conference Papers

- K. Mamidisetty, M. Ghamande, M. Ferrara and S. Sastry,
__A Domination Approach to Clustering Nodes for Data Aggregation__,*Proceedings of the Global Communications Conference (IEEE GLOBECOM), 2008*, 747-751. - M. Ferrara, R. Gould and C. Suffel, Spanning Tree Edge Densities, Proceedings of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theory
and Computing (Boca Raton, FL, 2002),
*Congr. Numer.***154**(2002), 155-163.

## Book Chapters

- M. Ferrara and R. Gould,
, in "Topics in Structural Graph Theory" (L. Beineke and R. Wilson, eds.),*H*-Linked Graphs*Encyclopedia of Mathematics and its Applications***147**, Cambridge University Press, 2012.*(Invited Book Chapter)*