Mike Ferrara's Publications

Submitted Papers

  1. J. Diemunsch, M. Ferrara, S. Jahanbekam and J. Shook, Extremal Theorems for Degree Sequence Packing and the 2-Color Discrete Tomography Problem.
  2. M. Ferrara, E. Gethner, S. Hartke, D. Stolee and P. Wenger, Extending Precolorings to Distinguish Group Actions.
  3. V. Borozan, M. Ferrara, S. Fujita, M. Furuya, Y. Manoussakis, N. N. and D. Stolee, Partitioning a Graph into Highly Connected Subgraphs.
  4. C. Erbes, M. Ferrara, R. Martin and P. Wenger, On the Approximate Shape of Degree Sequences that are not Potentially H-graphic.
  5. M. Ferrara, M. Jacobson, F. Pfender and P. Wenger, Graph Saturation in Multipartite Graphs.

Accepted for Publication

  1. M. Ferrara, T. LeSaulnier, C. Moffatt and P. Wenger, On the Sum Necessary to Ensure that a Degree Sequence is Potentially H-graphic, to appear in Combinatorica.
  2. A. Dudek and M. Ferrara, Extensions of results on rainbow Hamilton cycles in uniform hypergraphs, to appear in Graphs Comb.

Refereed Journal Papers


    2014


  1. G. Chen, M. Ferrara, Z. Hu, M. Jacobson and H. Liu, Degree Conditions for Spanning Brooms, J. Graph Theory 77 (2014), 237-250.
  2. A. Busch, M. Ferrara, S. Hartke and M. Jacobson, Ramsey-Type Numbers for Degree Sequences, Graphs Comb. 30 (2014), 847-859.
  3. 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.
  4. M. Ferrara, J. Kim and E. Yeager, Ramsey-minimal Saturation Numbers for Matchings, Discrete Math. 322 (2014), 26-30.
  5. 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


  6. 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.
  7. 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.
  8. M. Ferrara, M. Jacobson and F. Pfender, Degree Conditions for H-linked Digraphs, Combin. Probab. Comput 22 (2013), 684-699.
  9. 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).
  10. M. Ferrara, E. Gethner, S. Hartke, D. Stolee and P. Wenger, List Distinguishing Parameters of Trees, Discrete Applied Math. 161 (2013), 864-869.
  11. M. Ferrara, C. Magnant and P. Wenger, Conditions for Families of Disjoint k-connected Subgraphs in a Graph, Discrete Math. 313 (2013), 760-764.
  12. 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.



  13. 2012


  14. M. Ferrara, T. Morris and P. Wenger, Pancyclicity of 4-Connected, Claw-free, P10-free Graphs, J. Graph Theory 71 (2012), 435-447.
  15. 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.
  16. 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.
  17. 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.
  18. K. Mamidisetty, M. Ferrara and S. Sastry, Systematic Selection of Cluster Heads for Data Collection, J. Network and Computer Applications, 35 (2012), 1548-1558.
  19. 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.
  20. 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.
  21. M. Ferrara, M. Jacobson and J. Powell, Characterizing Degree-Sum Maximial Nonhamiltonian Bipartite Graphs, Discrete Math. 312 (2012), 459-461.



  22. 2011


  23. 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.
  24. M. Ferrara, B. Flesch and E. Gethner, List-Distinguishing Colorings of Graphs, Elec. J. Combin. 18 (2011), P161, 17pp.



  25. 2010


  26. 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.
  27. M. Ferrara, A. Harris and M. Jacobson, Hamiltonian Cycles Avoiding Sets of Edges in a Graph, Australasian J. Comb 48 (2010), 191-203.
  28. M. Ferrara, R. Gould, M. Karonski and F. Pfender, An Iterative Approach to Graph Irregularity Strength, Discrete Applied Math. 158 (2010), 1189-1194.
  29. 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.
  30. M. Ferrara, C. Magnant and J. Powell, Pan-H-Linked Graphs, Graphs Comb. 26 (2010), 225-242.
  31. M. Ferrara, A. Harris and M. Jacobson, The Game of F-saturator, Discrete Applied Math. 158 (2010), 189-197.



  32. 2009


  33. M. Ferrara, M. Jacobson, J. Schmitt, M. Siggers, Potentially H-Bigraphic Sequences, Discuss. Math. Graph Theory. 29 (2009), 583-596.
  34. 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.
  35. R. Faudree, M. Ferrara, R. Gould and M. Jacobson, tKp-saturated Graphs of Minimum Size, Discrete Math. 309 (2009), 5870-5876.
  36. M. Ferrara, J. Gilbert, M. Jacobson and T. Whalen, Irregularity Strength of Digraphs, Discrete Math. 309 (2009), 5834-5840.
  37. M. Ferrara, R. Gould, G. Tansey and T. Whalen, Disjoint Hamiltonian Cycles in Bipartite Graphs, Discrete Math. 309 (2009), 3811-3820.
  38. M. Ferrara and J. Schmitt, A General Lower Bound for Potentially H-Graphic Sequences, SIAM J. Discrete Math. 23 (2009), 517-526.
  39. 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.



  40. 2008


  41. 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.
  42. M. Ferrara, R. Gould, G. Tansey and T. Whalen, On H-Immersions, J. Graph Theory 57 (2008), 245-254.



  43. 2007


  44. 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.
  45. A. Busch, M. Ferrara and N. Kahl, Generalizing D-Graphs, Discrete Applied Math 155 (2007), 2487-2495.
  46. M. Ferrara, R. Gould and J. Schmitt, Graphic Sequences with a Realization Containing a Friendship Graph, Ars Combin. 85 (2007), 161-171.
  47. M. Ferrara, Graphic Sequences with a Realization Containing a Union of Arbitrary Cliques, Graphs Comb. 23 (2007), 263-269.



  48. Pre-2007


  49. M. Ferrara, R. Gould, G. Tansey and T. Whalen, On H-Linked Graphs, Graphs Comb. 22 (2006), 217-224.
  50. M. Ferrara, V. Rodl and Y. Kohayakawa, Distance Graphs on the Integers, Combin. Probab. Comput. 14 (2005), 107-131.

Conference Papers


  1. 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.
  2. 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


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