Michael S. Jacobson

94 papers Misc 1Journal 93

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