Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Ferrara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j53]Ilkyoo Choi
, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. 306: 120-132 (2022)- 2021
- [j52]James M. Carraher, Michael Ferrara, Timothy Morris, Michael Santana:
Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs. Discret. Math. 344(10): 112522 (2021) - 2020
- [j51]Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell:
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94(2): 252-266 (2020) - 2019
- [j50]Péter L. Erdös, Michael Ferrara, Stephen G. Hartke:
Navigating between packings of graphic sequences. Discret. Appl. Math. 266: 252-258 (2019) - [j49]Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam, Paul S. Wenger:
List-distinguishing Cartesian products of cliques. Discret. Math. 342(7): 2012-2022 (2019) - 2018
- [j48]Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White:
On the Strong Chromatic Index of Sparse Graphs. Electron. J. Comb. 25(3): 3 (2018) - [j47]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
Extending precolorings to distinguish group actions. Eur. J. Comb. 72: 12-28 (2018) - [j46]Catherine Erbes, Michael Ferrara, Ryan R. Martin, Paul S. Wenger:
Stability of the Potential Function. SIAM J. Discret. Math. 32(3): 2313-2331 (2018) - 2017
- [j45]Michael Ferrara, Bill Kay, Lucas Kramer, Ryan R. Martin, Benjamin Reiniger, Heather C. Smith, Eric Sullivan:
The saturation number of induced subposets of the Boolean lattice. Discret. Math. 340(10): 2479-2487 (2017) - [j44]Michael D. Barrus, Michael Ferrara, Jennifer Vandenbussche, Paul S. Wenger:
Colored Saturation Parameters for Rainbow Subgraphs. J. Graph Theory 86(4): 375-386 (2017) - 2016
- [j43]Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger:
On the sum necessary to ensure that a degree sequence is potentially H-graphic. Comb. 36(6): 687-702 (2016) - [j42]Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey:
I, F-partitions of sparse graphs. Eur. J. Comb. 57: 1-12 (2016) - [j41]Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. J. Graph Theory 82(3): 322-333 (2016) - 2015
- [j40]Andrzej Dudek, Michael Ferrara:
Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs. Graphs Comb. 31(3): 577-583 (2015) - [j39]Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James M. Shook:
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem. SIAM J. Discret. Math. 29(4): 2088-2099 (2015) - 2014
- [j38]Louis DeBiasio, Michael Ferrara, Timothy Morris:
Improved degree conditions for 2-factors with k cycles in hamiltonian graphs. Discret. Math. 320: 51-54 (2014) - [j37]Michael Ferrara, Jaehoon Kim, Elyse Yeager:
Ramsey-minimal saturation numbers for matchings. Discret. Math. 322: 26-30 (2014) - [j36]Jennifer Diemunsch, Michael Ferrara, Samantha Graffeo, Timothy Morris:
On 2-factors with a bounded number of odd components. Discret. Math. 323: 35-42 (2014) - [j35]Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson:
A Degree Sequence Variant of Graph Ramsey Numbers. Graphs Comb. 30(4): 847-859 (2014) - [j34]Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu:
Degree Conditions for Spanning Brooms. J. Graph Theory 77(3): 237-250 (2014) - 2013
- [j33]Ruijuan Li, Michael Ferrara, Xinhong Zhang, Shengjia Li:
A Fan-type degree condition for k-linked graphs. Australas. J Comb. 57: 139-144 (2013) - [j32]Sarah Behrens, Catherine Erbes, Michael Ferrara, Stephen G. Hartke, Benjamin Reiniger, Hannah Spinoza, Charles Tomlinson:
New Results on Degree Sequences of Uniform Hypergraphs. Electron. J. Comb. 20(4): 14 (2013) - [j31]Michael Ferrara, Michael S. Jacobson, Florian Pfender:
Degree Conditions for H-Linked Digraphs. Comb. Probab. Comput. 22(5): 684-699 (2013) - [j30]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
List distinguishing parameters of trees. Discret. Appl. Math. 161(6): 864-869 (2013) - [j29]Michael Ferrara, Silke Gehrke, Ronald J. Gould, Colton Magnant, Jeffrey S. Powell:
Pancyclicity of 4-connected {claw, generalized bull}-free graphs. Discret. Math. 313(4): 460-467 (2013) - [j28]Michael Ferrara, Colton Magnant, Paul S. Wenger:
Conditions for families of disjoint k-connected subgraphs in a graph. Discret. Math. 313(6): 760-764 (2013) - 2012
- [j27]Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, Paul S. Wenger:
Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs. Electron. J. Comb. 19(2): 52 (2012) - [j26]Michael Ferrara, Michael S. Jacobson, Jeffrey S. Powell:
Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discret. Math. 312(2): 459-461 (2012) - [j25]Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West:
Packing of graphic n-tuples. J. Graph Theory 70(1): 29-39 (2012) - [j24]Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen:
New Ore-Type Conditions for H-Linked Graphs. J. Graph Theory 71(1): 69-77 (2012) - [j23]Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse, Paul S. Wenger:
Saturation numbers for families of graph subdivisions. J. Graph Theory 71(4): 416-434 (2012) - [j22]Michael Ferrara, Timothy Morris, Paul S. Wenger:
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs. J. Graph Theory 71(4): 435-447 (2012) - [j21]Kranthi K. Mamidisetty, Michael J. Ferrara, Shivakumar Sastry:
Systematic selection of cluster heads for data collection. J. Netw. Comput. Appl. 35(5): 1548-1558 (2012) - [j20]Michael Ferrara, Michael Stephens, Leslie Marchut, Chris Yang, Ventony Fryar, Preston Scott:
Analysis of in situ monitored thermal cycling benefits for wireless packaging early reliability evaluation. Microelectron. Reliab. 52(1): 9-15 (2012) - 2011
- [j19]Michael Ferrara, Breeann Flesch, Ellen Gethner:
List-Distinguishing Colorings of Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j18]Michael J. Ferrara, Michael S. Jacobson, Angela K. Harlan:
Hamiltonian cycles avoiding sets of edges in a graph. Australas. J Comb. 48: 191-204 (2010) - [j17]Michael Ferrara, Michael S. Jacobson, Angela Harris:
The game of F-saturator. Discret. Appl. Math. 158(3): 189-197 (2010) - [j16]Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender:
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158(11): 1189-1194 (2010) - [j15]Michael Ferrara, Michael S. Jacobson, Angela Harris:
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum. Graphs Comb. 26(2): 215-223 (2010) - [j14]Michael Ferrara, Colton Magnant, Jeffrey S. Powell:
Pan-H-Linked Graphs. Graphs Comb. 26(2): 225-242 (2010) - 2009
- [j13]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
Disjoint hamiltonian cycles in bipartite graphs. Discret. Math. 309(12): 3811-3820 (2009) - [j12]Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson:
tKp-saturated graphs of minimum size. Discret. Math. 309(19): 5870-5876 (2009) - [j11]Michael Ferrara, Christine Lee, Phil Wallis, Ellen Gethner:
deBruijn-like sequences and the irregular chromatic number of paths and cycles. Discret. Math. 309(20): 6074-6080 (2009) - [j10]Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers:
Potentially H-bigraphic sequences. Discuss. Math. Graph Theory 29(3): 583-596 (2009) - [j9]Michael Ferrara, John R. Schmitt:
A General Lower Bound for Potentially H-Graphic Sequences. SIAM J. Discret. Math. 23(1): 517-526 (2009) - 2008
- [j8]Guantao Chen, Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic sequences with a realization containing a complete multipartite subgraph. Discret. Math. 308(23): 5712-5721 (2008) - [j7]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
On H-immersions. J. Graph Theory 57(3): 245-254 (2008) - 2007
- [j6]Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic Sequences with a Realization Containing a Friendship Graph. Ars Comb. 85 (2007) - [j5]Arthur H. Busch, Michael Ferrara, Nathan Kahl:
Generalizing D-graphs. Discret. Appl. Math. 155(18): 2487-2495 (2007) - [j4]Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs. Discuss. Math. Graph Theory 27(3): 507-526 (2007) - [j3]John R. Schmitt, Michael Ferrara:
An Erdös-Stone Type Conjecture for Graphic Sequences. Electron. Notes Discret. Math. 28: 131-135 (2007) - [j2]Michael Ferrara:
Graphic Sequences with a Realization Containing a Union of Cliques. Graphs Comb. 23(3): 263-269 (2007) - 2006
- [j1]Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
On H-Linked Graphs. Graphs Comb. 22(2): 217-224 (2006)
Informal and Other Publications
- 2020
- [i2]Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR abs/2004.10917 (2020) - 2015
- [i1]Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey:
I, F-partitions of Sparse Graphs. CoRR abs/1510.03381 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
