Michael Ferrara
University of Colorado Denver
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Michael Ferrara.
Graphs and Combinatorics | 2010
Michael Ferrara; Colton Magnant; Jeffrey S. Powell
Let H be a multigraph, possibly containing loops. An H-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n0(H) isolated vertices and n1(H) vertices of degree one. In Gould and Whalen (Graphs Comb. 23:165–182, 2007) it was shown that if G is a simple graph of order n containing an H-subdivision
Journal of Graph Theory | 2012
Arthur H. Busch; Michael Ferrara; Stephen G. Hartke; Michael S. Jacobson; Hemanshu Kaul; Douglas B. West
Discrete Mathematics | 2009
Ralph J. Faudree; Michael Ferrara; Ronald J. Gould; Michael S. Jacobson
{\mathcal{H}}
Journal of Graph Theory | 2012
Michael Ferrara; Ronald J. Gould; Michael S. Jacobson; Florian Pfender; Jeffrey S. Powell; Thor Whalen
Graphs and Combinatorics | 2010
Michael Ferrara; Michael S. Jacobson; Angela Harris
and
Combinatorics, Probability & Computing | 2005
Michael Ferrara; Yoshiharu Kohayakawa; Vojtech Rödl
Discrete Mathematics | 2012
Michael Ferrara; Michael S. Jacobson; Jeffrey S. Powell
{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}}
SIAM Journal on Discrete Mathematics | 2008
Michael Ferrara; John R. Schmitt
SIAM Journal on Discrete Mathematics | 2015
Jennifer Diemunsch; Michael Ferrara; Sogol Jahanbekam; James M. Shook
, then G contains a spanning H-subdivision with the same ground set as
Discussiones Mathematicae Graph Theory | 2007
Michael Ferrara; Ronald J. Gould; Stephen G. Hartke