Michael S. Jacobson

According to our database, Michael S. Jacobson authored at least 94 papers between 1980 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2019

Gaps in the saturation spectrum of trees.

Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas

Discuss. Math. Graph Theory, 2019

2018

Degree sum and vertex dominating paths.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson

J. Graph Theory, 2018

2017

Minimum Degree and Dominating Paths.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West

J. Graph Theory, 2017

Saturation spectrum of paths and stars.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas

Discuss. Math. Graph Theory, 2017

2014

Degree Conditions for Spanning Brooms.

Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu

J. Graph Theory, 2014

A Degree Sequence Variant of Graph Ramsey Numbers.

Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson

Graphs Comb., 2014

2013

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs.

Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis

Graphs Comb., 2013

Minimum degree and disjoint cycles in generalized claw-free graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Eur. J. Comb., 2013

Weak saturation numbers for sparse graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2013

Degree Conditions for <i>H</i>-Linked Digraphs.

Michael Ferrara, Michael S. Jacobson, Florian Pfender

Comb. Probab. Comput., 2013

2012

Saturation numbers for families of graph subdivisions.

Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse, Paul S. Wenger

J. Graph Theory, 2012

New Ore-Type Conditions for <i>H</i>-Linked Graphs.

Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen

J. Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

J. Graph Theory, 2012

Packing of graphic <i>n</i>-tuples.

Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West

J. Graph Theory, 2012

Characterizing degree-sum maximal nonhamiltonian bipartite graphs.

Michael Ferrara, Michael S. Jacobson, Jeffrey S. Powell

Discret. Math., 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Comb. Probab. Comput., 2012

2010

Transitive partitions in realizations of tournament score sequences.

Arthur H. Busch, Guantao Chen, Michael S. Jacobson

J. Graph Theory, 2010

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum.

Michael Ferrara, Michael S. Jacobson, Angela Harris

Graphs Comb., 2010

Chvátal-Erdös type theorems.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

Discuss. Math. Graph Theory, 2010

The game of F-saturator.

Michael Ferrara, Michael S. Jacobson, Angela Harris

Discret. Appl. Math., 2010

Hamiltonian cycles avoiding sets of edges in a graph.

Michael J. Ferrara, Michael S. Jacobson, Angela K. Harlan

Australas. J Comb., 2010

Ramsey numbers in rainbow triangle free colorings.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant

Australas. J Comb., 2010

2009

Potentially <i>H</i>-bigraphic sequences.

Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers

Discuss. Math. Graph Theory, 2009

Pancyclic graphs and linear forests.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2009

tK_p-saturated graphs of minimum size.

Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2009

Saturation Numbers for Trees.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Electron. J. Comb., 2009

2006

Cycle Extendability of Hamiltonian Interval Graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

SIAM J. Discret. Math., 2006

On arc-traceable tournaments.

Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid

J. Graph Theory, 2006

Odd cycles and Theta-cycles in hypergraphs.

András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Discret. Math., 2006

2005

Minimal Degree and (<i>k, m</i>)-Pancyclic Ordered Graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2005

On a conjecture of Quintas and arc-traceability in upset tournaments.

Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid

Discuss. Math. Graph Theory, 2005

A note on 2-factors with two components.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito

Discret. Math., 2005

2004

The Bar Visibility Number of a Graph.

Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West

SIAM J. Discret. Math., 2004

Generalizing Pancyclic and <i>k</i>-Ordered Graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2004

Forbidden triples implying Hamiltonicity: for all graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson

Discuss. Math. Graph Theory, 2004

Linear forests and ordered cycles.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender

Discuss. Math. Graph Theory, 2004

Toughness, degrees and 2-factors.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito

Discret. Math., 2004

2003

On non-z(mod k) dominating sets.

Yair Caro, Michael S. Jacobson

Discuss. Math. Graph Theory, 2003

2002

Fragile graphs with small independent cuts.

Guantao Chen, Ralph J. Faudree, Michael S. Jacobson

J. Graph Theory, 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 2002

2001

Destroying symmetry by orienting edges: Complete graphs and complete bigraphs.

Frank Harary, Michael S. Jacobson

Discuss. Math. Graph Theory, 2001

Two-factors with few cycles in claw-free graphs.

Ronald J. Gould, Michael S. Jacobson

Discret. Math., 2001

Edge disjoint monochromatic triangles in 2-colored graphs.

Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel

Discret. Math., 2001

Tolerance orders and bipartite unit tolerance graphs.

Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris

Discret. Math., 2001

2000

On <i>k</i>-ordered graphs.

Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

J. Graph Theory, 2000

Even Cycles in Graphs with Many Odd Cycles.

Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp

Graphs Comb., 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 2000

Clique covering the edges of a locally cobipartite graph.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang

Discret. Math., 2000

PC based system for heart rate variability analysis.

Kamal Ali, Isam Taha, Michael S. Jacobson

Proceedings of the ISCA 15th International Conference Computers and Their Applications, 2000

1999

Generalized Ramsey theory and decomposable properties of graphs.

Stefan A. Burr, Michael S. Jacobson, Peter Mihók, Gabriel Semanisin

Discuss. Math. Graph Theory, 1999

On 2-factors containing 1-factors in bipartite graphs.

Guantao Chen, Ronald J. Gould, Michael S. Jacobson

Discret. Math., 1999

Scenic graphs II: non-traceable graphs.

Michael S. Jacobson, André E. Kézdy, Jeno Lehel

Australas. J Comb., 1999

1998

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Networks, 1998

Tough enough chordal graphs are Hamiltonian.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Networks, 1998

Note on graphs without repeated cycle lengths.

Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve

J. Graph Theory, 1998

Scenic Graphs I: Traceable Graphs.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Ars Comb., 1998

1997

Recognizing Intersection Graphs of Linear Uniform Hypergraphs.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Graphs Comb., 1997

Degree Sum Conditions for Hamiltonicity on k-Partite Graphs.

Guantao Chen, Michael S. Jacobson

Graphs Comb., 1997

On fractional Ramsey numbers.

Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman

Discret. Math., 1997

1996

Graph spectra.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak

Discret. Math., 1996

1995

The 2-intersection number of paths and bounded-degree trees.

Michael S. Jacobson, André E. Kézdy, Douglas B. West

J. Graph Theory, 1995

Hamiltonicity in balanced<i>k</i>-partite graphs.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Graphs Comb., 1995

Spanning caterpllars with bounded diameter.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discuss. Math. Graph Theory, 1995

Irregular embeddings of multigraphs with fixed chromatic number.

Michael S. Jacobson, Jenö Lehel

Discret. Math., 1995

Irregular embeddings of hypergraphs with fixed chromatic number.

Michael S. Jacobson, Jenö Lehel

Discret. Math., 1995

Degree conditions and cycle extendability.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 1995

1994

Neighborhood unions and the cycle cover number of a graph.

Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1994

1993

A Note on Graphs Which Have Upper Irredundance Equal to Independence.

Michael S. Jacobson, Kenneth Peters

Discret. Appl. Math., 1993

Ø-Threshold and Ø-Tolerance Chain Graphs.

Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak

Discret. Appl. Math., 1993

Subtree and Substar Intersection Numbers.

Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West

Discret. Appl. Math., 1993

1992

On the <i>p</i>-Edge Clique Cover Number of Complete Bipartite Graphs.

Michael S. Jacobson

SIAM J. Discret. Math., 1992

On independent generalized degrees and independence numbers in K(1, m)-free graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Terri Lindquester

Discret. Math., 1992

Neighborhood unions and a generalization of Dirac's theorem.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

Discret. Math., 1992

1991

General results on tolerance intersection graphs.

Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman

J. Graph Theory, 1991

Decompositions of regular bipartite graphs.

Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza

Discret. Math., 1991

Irregularity strength of dense graphs.

Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel

Discret. Math., 1991

1990

Lower bounds for lower Ramsey numbers.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak

J. Graph Theory, 1990

Chordal graphs and upper irredundance, upper domination and independence.

Michael S. Jacobson, Kenneth Peters

Discret. Math., 1990

The bondage number of a graph.

John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts

Discret. Math., 1990

1989

Neighborhood unions and hamiltonian properties in graphs.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Comb. Theory, Ser. B, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.

Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould, Linda M. Lesniak

Eur. J. Comb., 1989

Irregular networks, regular graphs and integer matrices with distinct row and column sums.

Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel

Discret. Math., 1989

1988

On a generalization of transitivity for digraphs.

András Gyárfás, Michael S. Jacobson, Lael F. Kinch

Discret. Math., 1988

1987

Extremal problems involving neighborhood unions.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp

J. Graph Theory, 1987

Goodness of trees for generalized books.

Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson

Graphs Comb., 1987

1986

On the domination of the products of graphs II: Trees.

Michael S. Jacobson, Lael F. Kinch

J. Graph Theory, 1986

1984

Forbidden subgraphs and hamiitonian properties in the square of a connected graph.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1984

1983

On the Ramsey number of trees versus graphs with large clique number.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1983

1982

Bounds for the ramsey number of a disconnected graph versus any graph.

Ronald J. Gould, Michael S. Jacobson

J. Graph Theory, 1982

On the Ramsey multiplicity for stars.

Michael S. Jacobson

Discret. Math., 1982

On a generalization of Ramsey theory.

Michael S. Jacobson

Discret. Math., 1982

Forbidden subgraphs and Hamiltonian properties of graphs.

Ronald J. Gould, Michael S. Jacobson

Discret. Math., 1982

1980

A note on Ramsey multiplicity.

Michael S. Jacobson

Discret. Math., 1980