Michael S. Jacobson

Publication Activity (10 Years)

Years Active: 1980-2019
Publications (10 Years): 4

Top Topics

Graph Theoretic

Sufficient Conditions

Series Parallel

Vertically Partitioned

Top Venues

J. Graph Theory

Discuss. Math. Graph Theory

Comb. Probab. Comput.

Publications

Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas
Gaps in the saturation spectrum of trees. Discuss. Math. Graph Theory 39 (1) (2019)
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson
Degree sum and vertex dominating paths. J. Graph Theory 89 (3) (2018)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West
Minimum Degree and Dominating Paths. J. Graph Theory 84 (2) (2017)
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas
Saturation spectrum of paths and stars. Discuss. Math. Graph Theory 37 (3) (2017)
Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson
A Degree Sequence Variant of Graph Ramsey Numbers. Graphs Comb. 30 (4) (2014)
Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu
Degree Conditions for Spanning Brooms. J. Graph Theory 77 (3) (2014)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Weak saturation numbers for sparse graphs. Discuss. Math. Graph Theory 33 (4) (2013)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Minimum degree and disjoint cycles in generalized claw-free graphs. Eur. J. Comb. 34 (5) (2013)
Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. Graphs Comb. 29 (3) (2013)
Michael Ferrara, Michael S. Jacobson, Florian Pfender
-Linked Digraphs. Comb. Probab. Comput. 22 (5) (2013)
Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West
-tuples. J. Graph Theory 70 (1) (2012)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69 (1) (2012)
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) (2012)
Michael Ferrara, Michael S. Jacobson, Jeffrey S. Powell
Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discret. Math. 312 (2) (2012)
Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen
-Linked Graphs. J. Graph Theory 71 (1) (2012)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
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) (2010)
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant
Chvátal-Erdös type theorems. Discuss. Math. Graph Theory 30 (2) (2010)
Michael J. Ferrara, Michael S. Jacobson, Angela K. Harlan
Hamiltonian cycles avoiding sets of edges in a graph. Australas. J Comb. 48 (2010)
Arthur H. Busch, Guantao Chen, Michael S. Jacobson
Transitive partitions in realizations of tournament score sequences. J. Graph Theory 64 (1) (2010)
Michael Ferrara, Michael S. Jacobson, Angela Harris
The game of F-saturator. Discret. Appl. Math. 158 (3) (2010)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46 (2010)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Pancyclic graphs and linear forests. Discret. Math. 309 (5) (2009)
Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers
-bigraphic sequences. Discuss. Math. Graph Theory 29 (3) (2009)
Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson
-saturated graphs of minimum size. Discret. Math. 309 (19) (2009)
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Saturation Numbers for Trees. Electron. J. Comb. 16 (1) (2009)
Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20 (3) (2006)
Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid
On arc-traceable tournaments. J. Graph Theory 53 (2) (2006)
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Odd cycles and Theta-cycles in hypergraphs. Discret. Math. 306 (19-20) (2006)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
A note on 2-factors with two components. Discret. Math. 300 (1-3) (2005)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
)-Pancyclic Ordered Graphs. Graphs Comb. 21 (2) (2005)
Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid
On a conjecture of Quintas and arc-traceability in upset tournaments. Discuss. Math. Graph Theory 25 (3) (2005)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25 (3) (2005)
Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24 (3) (2004)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
Toughness, degrees and 2-factors. Discret. Math. 286 (3) (2004)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
-Ordered Graphs. Graphs Comb. 20 (3) (2004)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson
Forbidden triples implying Hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24 (1) (2004)
Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West
The Bar Visibility Number of a Graph. SIAM J. Discret. Math. 18 (3) (2004)
Yair Caro, Michael S. Jacobson
On non-z(mod k) dominating sets. Discuss. Math. Graph Theory 23 (1) (2003)
Guantao Chen, Ralph J. Faudree, Michael S. Jacobson
Fragile graphs with small independent cuts. J. Graph Theory 41 (4) (2002)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Characterizing forbidden clawless triples implying hamiltonian graphs. Discret. Math. 249 (1-3) (2002)
Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. 231 (1-3) (2001)
Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris
Tolerance orders and bipartite unit tolerance graphs. Discret. Math. 226 (1-3) (2001)
Frank Harary, Michael S. Jacobson
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. Discuss. Math. Graph Theory 21 (2) (2001)
Ronald J. Gould, Michael S. Jacobson
Two-factors with few cycles in claw-free graphs. Discret. Math. 231 (1-3) (2001)
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
-ordered graphs. J. Graph Theory 35 (2) (2000)
Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp
Even Cycles in Graphs with Many Odd Cycles. Graphs Comb. 16 (4) (2000)
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219 (1-3) (2000)
Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16 (1) (2000)
Kamal Ali, Isam Taha, Michael S. Jacobson
PC based system for heart rate variability analysis. CATA (2000)
Stefan A. Burr, Michael S. Jacobson, Peter Mihók, Gabriel Semanisin
Generalized Ramsey theory and decomposable properties of graphs. Discuss. Math. Graph Theory 19 (2) (1999)
Guantao Chen, Ronald J. Gould, Michael S. Jacobson
On 2-factors containing 1-factors in bipartite graphs. Discret. Math. (1999)
Michael S. Jacobson, André E. Kézdy, Jeno Lehel
Scenic graphs II: non-traceable graphs. Australas. J Comb. 19 (1999)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998)
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Tough enough chordal graphs are Hamiltonian. Networks 31 (1) (1998)
Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve
Note on graphs without repeated cycle lengths. J. Graph Theory 29 (1) (1998)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. Networks 31 (1) (1998)
Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman
On fractional Ramsey numbers. Discret. Math. 176 (1-3) (1997)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13 (4) (1997)
Guantao Chen, Michael S. Jacobson
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. Graphs Comb. 13 (4) (1997)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
Graph spectra. Discret. Math. 150 (1-3) (1996)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Spanning caterpllars with bounded diameter. Discuss. Math. Graph Theory 15 (2) (1995)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Degree conditions and cycle extendability. Discret. Math. 141 (1-3) (1995)
Michael S. Jacobson, Jenö Lehel
Irregular embeddings of multigraphs with fixed chromatic number. Discret. Math. 145 (1-3) (1995)
Michael S. Jacobson, Jenö Lehel
Irregular embeddings of hypergraphs with fixed chromatic number. Discret. Math. 145 (1-3) (1995)
Michael S. Jacobson, André E. Kézdy, Douglas B. West
The 2-intersection number of paths and bounded-degree trees. J. Graph Theory 19 (4) (1995)
Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
-partite graphs. Graphs Comb. 11 (3) (1995)
Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18 (7) (1994)
Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West
Subtree and Substar Intersection Numbers. Discret. Appl. Math. 44 (1-3) (1993)
Michael S. Jacobson, Kenneth Peters
A Note on Graphs Which Have Upper Irredundance Equal to Independence. Discret. Appl. Math. 44 (1-3) (1993)
Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester
On independent generalized degrees and independence numbers in K(1, m)-free graphs. Discret. Math. 103 (1) (1992)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Neighborhood unions and a generalization of Dirac's theorem. Discret. Math. 105 (1-3) (1992)
Michael S. Jacobson
-Edge Clique Cover Number of Complete Bipartite Graphs. SIAM J. Discret. Math. 5 (4) (1992)
Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman
General results on tolerance intersection graphs. J. Graph Theory 15 (6) (1991)
Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
Irregularity strength of dense graphs. Discret. Math. 91 (1) (1991)
Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza
Decompositions of regular bipartite graphs. Discret. Math. 89 (1) (1991)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
Lower bounds for lower Ramsey numbers. J. Graph Theory 14 (6) (1990)
John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts
The bondage number of a graph. Discret. Math. 86 (1-3) (1990)
Michael S. Jacobson, Kenneth Peters
Chordal graphs and upper irredundance, upper domination and independence. Discret. Math. 86 (1-3) (1990)
Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. 76 (3) (1989)
Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak
On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs. Eur. J. Comb. 10 (5) (1989)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory, Ser. B 47 (1) (1989)
András Gyárfás, Michael S. Jacobson, Lael F. Kinch
On a generalization of transitivity for digraphs. Discret. Math. 69 (1) (1988)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
Extremal problems involving neighborhood unions. J. Graph Theory 11 (4) (1987)
Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson
Goodness of trees for generalized books. Graphs Comb. 3 (1) (1987)
Michael S. Jacobson, Lael F. Kinch
On the domination of the products of graphs II: Trees. J. Graph Theory 10 (1) (1986)
Ronald J. Gould, Michael S. Jacobson
Forbidden subgraphs and hamiitonian properties in the square of a connected graph. J. Graph Theory 8 (1) (1984)
Ronald J. Gould, Michael S. Jacobson
On the Ramsey number of trees versus graphs with large clique number. J. Graph Theory 7 (1) (1983)
Ronald J. Gould, Michael S. Jacobson
Forbidden subgraphs and Hamiltonian properties of graphs. Discret. Math. 42 (2-3) (1982)
Michael S. Jacobson
On a generalization of Ramsey theory. Discret. Math. 38 (2-3) (1982)
Ronald J. Gould, Michael S. Jacobson
Bounds for the ramsey number of a disconnected graph versus any graph. J. Graph Theory 6 (4) (1982)
Michael S. Jacobson
On the Ramsey multiplicity for stars. Discret. Math. 42 (1) (1982)
Michael S. Jacobson
A note on Ramsey multiplicity. Discret. Math. 29 (2) (1980)