default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael S. Jacobson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j93]Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas:
Gaps in the saturation spectrum of trees. Discuss. Math. Graph Theory 39(1): 157-170 (2019)- 2018
- [j92]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): 250-265 (2018) - 2017
- [j91]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): 811-822 (2017) - [j90]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Douglas B. West:
Minimum Degree and Dominating Paths. J. Graph Theory 84(2): 202-213 (2017) - 2014
- [j89]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) - [j88]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
- [j87]Michael Ferrara, Michael S. Jacobson, Florian Pfender:
Degree Conditions for H-Linked Digraphs. Comb. Probab. Comput. 22(5): 684-699 (2013) - [j86]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Weak saturation numbers for sparse graphs. Discuss. Math. Graph Theory 33(4): 677-693 (2013) - [j85]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum degree and disjoint cycles in generalized claw-free graphs. Eur. J. Comb. 34(5): 875-883 (2013) - [j84]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): 359-364 (2013) - 2012
- [j83]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. Comb. Probab. Comput. 21(1-2): 129-139 (2012) - [j82]Michael Ferrara, Michael S. Jacobson, Jeffrey S. Powell:
Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discret. Math. 312(2): 459-461 (2012) - [j81]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1): 28-45 (2012) - [j80]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) - [j79]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) - [j78]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) - 2010
- [j77]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46: 269-284 (2010) - [j76]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) - [j75]Michael Ferrara, Michael S. Jacobson, Angela Harris:
The game of F-saturator. Discret. Appl. Math. 158(3): 189-197 (2010) - [j74]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): 245-256 (2010) - [j73]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) - [j72]Arthur H. Busch, Guantao Chen, Michael S. Jacobson:
Transitive partitions in realizations of tournament score sequences. J. Graph Theory 64(1): 52-62 (2010)
2000 – 2009
- 2009
- [j71]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Saturation Numbers for Trees. Electron. J. Comb. 16(1) (2009) - [j70]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Pancyclic graphs and linear forests. Discret. Math. 309(5): 1178-1189 (2009) - [j69]Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson:
tKp-saturated graphs of minimum size. Discret. Math. 309(19): 5870-5876 (2009) - [j68]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) - 2006
- [j67]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): 2481-2491 (2006) - [j66]Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On arc-traceable tournaments. J. Graph Theory 53(2): 157-166 (2006) - [j65]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20(3): 682-689 (2006) - 2005
- [j64]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): 218-224 (2005) - [j63]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25(3): 273-289 (2005) - [j62]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): 345-354 (2005) - [j61]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Minimal Degree and (k, m)-Pancyclic Ordered Graphs. Graphs Comb. 21(2): 197-211 (2005) - 2004
- [j60]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - [j59]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Forbidden triples implying Hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24(1): 47-54 (2004) - [j58]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): 359-372 (2004) - [j57]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Generalizing Pancyclic and k-Ordered Graphs. Graphs Comb. 20(3): 291-309 (2004) - [j56]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): 462-471 (2004) - 2003
- [j55]Yair Caro, Michael S. Jacobson:
On non-z(mod k) dominating sets. Discuss. Math. Graph Theory 23(1): 189-199 (2003) - 2002
- [j54]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Characterizing forbidden clawless triples implying hamiltonian graphs. Discret. Math. 249(1-3): 71-81 (2002) - [j53]Guantao Chen, Ralph J. Faudree, Michael S. Jacobson:
Fragile graphs with small independent cuts. J. Graph Theory 41(4): 327-341 (2002) - 2001
- [j52]Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris:
Tolerance orders and bipartite unit tolerance graphs. Discret. Math. 226(1-3): 35-50 (2001) - [j51]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): 135-141 (2001) - [j50]Ronald J. Gould, Michael S. Jacobson:
Two-factors with few cycles in claw-free graphs. Discret. Math. 231(1-3): 191-197 (2001) - [j49]Frank Harary, Michael S. Jacobson:
Destroying symmetry by orienting edges: Complete graphs and complete bigraphs. Discuss. Math. Graph Theory 21(2): 149-158 (2001) - 2000
- [j48]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): 17-26 (2000) - [j47]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): 67-80 (2000) - [j46]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): 399-410 (2000) - [j45]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
On k-ordered graphs. J. Graph Theory 35(2): 69-82 (2000) - [c1]Kamal Ali, Isam Taha, Michael S. Jacobson:
PC based system for heart rate variability analysis. CATA 2000: 29-32
1990 – 1999
- 1999
- [j44]Michael S. Jacobson, André E. Kézdy, Jeno Lehel:
Scenic graphs II: non-traceable graphs. Australas. J Comb. 19: 287- (1999) - [j43]Guantao Chen, Ronald J. Gould, Michael S. Jacobson:
On 2-factors containing 1-factors in bipartite graphs. Discret. Math. 197-198: 185-194 (1999) - [j42]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): 199-217 (1999) - 1998
- [j41]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998) - [j40]Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve:
Note on graphs without repeated cycle lengths. J. Graph Theory 29(1): 11-15 (1998) - [j39]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): 1-10 (1998) - [j38]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) - 1997
- [j37]Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman:
On fractional Ramsey numbers. Discret. Math. 176(1-3): 159-175 (1997) - [j36]Guantao Chen, Michael S. Jacobson:
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. Graphs Comb. 13(4): 325-343 (1997) - [j35]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13(4): 359-367 (1997) - 1996
- [j34]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Graph spectra. Discret. Math. 150(1-3): 103-113 (1996) - 1995
- [j33]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Degree conditions and cycle extendability. Discret. Math. 141(1-3): 109-122 (1995) - [j32]Michael S. Jacobson, Jenö Lehel:
Irregular embeddings of hypergraphs with fixed chromatic number. Discret. Math. 145(1-3): 145-150 (1995) - [j31]Michael S. Jacobson, Jenö Lehel:
Irregular embeddings of multigraphs with fixed chromatic number. Discret. Math. 145(1-3): 295-299 (1995) - [j30]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Spanning caterpllars with bounded diameter. Discuss. Math. Graph Theory 15(2): 111-118 (1995) - [j29]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - [j28]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): 461-469 (1995) - 1994
- [j27]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): 663-672 (1994) - 1993
- [j26]Michael S. Jacobson, Kenneth Peters:
A Note on Graphs Which Have Upper Irredundance Equal to Independence. Discret. Appl. Math. 44(1-3): 91-97 (1993) - [j25]Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. 44(1-3): 191-203 (1993) - [j24]Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West:
Subtree and Substar Intersection Numbers. Discret. Appl. Math. 44(1-3): 205-220 (1993) - 1992
- [j23]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): 17-24 (1992) - [j22]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): 61-71 (1992) - [j21]Michael S. Jacobson:
On the p-Edge Clique Cover Number of Complete Bipartite Graphs. SIAM J. Discret. Math. 5(4): 539-544 (1992) - 1991
- [j20]Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza:
Decompositions of regular bipartite graphs. Discret. Math. 89(1): 17-27 (1991) - [j19]Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel:
Irregularity strength of dense graphs. Discret. Math. 91(1): 45-59 (1991) - [j18]Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman:
General results on tolerance intersection graphs. J. Graph Theory 15(6): 573-577 (1991) - 1990
- [j17]John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts:
The bondage number of a graph. Discret. Math. 86(1-3): 47-57 (1990) - [j16]Michael S. Jacobson, Kenneth Peters:
Chordal graphs and upper irredundance, upper domination and independence. Discret. Math. 86(1-3): 59-69 (1990) - [j15]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Lower bounds for lower Ramsey numbers. J. Graph Theory 14(6): 723-730 (1990)
1980 – 1989
- 1989
- [j14]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): 223-240 (1989) - [j13]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): 427-433 (1989) - [j12]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and hamiltonian properties in graphs. J. Comb. Theory B 47(1): 1-9 (1989) - 1988
- [j11]András Gyárfás, Michael S. Jacobson, Lael F. Kinch:
On a generalization of transitivity for digraphs. Discret. Math. 69(1): 35-41 (1988) - 1987
- [j10]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): 1-6 (1987) - [j9]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Extremal problems involving neighborhood unions. J. Graph Theory 11(4): 555-564 (1987) - 1986
- [j8]Michael S. Jacobson, Lael F. Kinch:
On the domination of the products of graphs II: Trees. J. Graph Theory 10(1): 97-106 (1986) - 1984
- [j7]Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and hamiitonian properties in the square of a connected graph. J. Graph Theory 8(1): 147-154 (1984) - 1983
- [j6]Ronald J. Gould, Michael S. Jacobson:
On the Ramsey number of trees versus graphs with large clique number. J. Graph Theory 7(1): 71-78 (1983) - 1982
- [j5]Michael S. Jacobson:
On a generalization of Ramsey theory. Discret. Math. 38(2-3): 191-195 (1982) - [j4]Michael S. Jacobson:
On the Ramsey multiplicity for stars. Discret. Math. 42(1): 63-66 (1982) - [j3]Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and Hamiltonian properties of graphs. Discret. Math. 42(2-3): 189-196 (1982) - [j2]Ronald J. Gould, Michael S. Jacobson:
Bounds for the ramsey number of a disconnected graph versus any graph. J. Graph Theory 6(4): 413-417 (1982) - 1980
- [j1]Michael S. Jacobson:
A note on Ramsey multiplicity. Discret. Math. 29(2): 201-203 (1980)
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-10-07 21:17 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:
