![]() | ![]() |
| 2012 | ||
|---|---|---|
| 56 | Michael Ferrara, Michael S. Jacobson, Jeffrey Powell: Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discrete Mathematics 312(2): 459-461 (2012) | |
| 55 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant: Distributing vertices on Hamiltonian cycles. Journal of Graph Theory 69(1): 28-45 (2012) | |
| 54 | Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West: Packing of graphic n-tuples. Journal of Graph Theory 70(1): 29-39 (2012) | |
| 2010 | ||
| 53 | Michael Ferrara, Michael S. Jacobson, Angela Harris: The game of F-saturator. Discrete Applied Mathematics 158(3): 189-197 (2010) | |
| 52 | Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant: Chvátal-Erdös type theorems. Discussiones Mathematicae Graph Theory 30(2): 245-256 (2010) | |
| 51 | Michael Ferrara, Michael S. Jacobson, Angela Harris: Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum. Graphs and Combinatorics 26(2): 215-223 (2010) | |
| 50 | Arthur H. Busch, Guantao Chen, Michael S. Jacobson: Transitive partitions in realizations of tournament score sequences. Journal of Graph Theory 64(1): 52-62 (2010) | |
| 2009 | ||
| 49 | Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson: tKp-saturated graphs of minimum size. Discrete Mathematics 309(19): 5870-5876 (2009) | |
| 48 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Pancyclic graphs and linear forests. Discrete Mathematics 309(5): 1178-1189 (2009) | |
| 47 | Michael J. Ferrara, Michael S. Jacobson, John R. Schmitt, Mark H. Siggers: Potentially H-bigraphic sequences. Discussiones Mathematicae Graph Theory 29(3): 583-596 (2009) | |
| 46 | Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Saturation Numbers for Trees. Electr. J. Comb. 16(1): (2009) | |
| 2006 | ||
| 45 | András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Odd cycles and Theta-cycles in hypergraphs. Discrete Mathematics 306(19-20): 2481-2491 (2006) | |
| 44 | Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid: On arc-traceable tournaments. Journal of Graph Theory 53(2): 157-166 (2006) | |
| 43 | Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discrete Math. 20(3): 682-689 (2006) | |
| 2005 | ||
| 42 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito: A note on 2-factors with two components. Discrete Mathematics 300(1-3): 218-224 (2005) | |
| 41 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Potential forbidden triples implying hamiltonicity: for sufficiently large graphs. Discussiones Mathematicae Graph Theory 25(3): 273-289 (2005) | |
| 40 | Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid: On a conjecture of Quintas and arc-traceability in upset tournaments. Discussiones Mathematicae Graph Theory 25(3): 345-354 (2005) | |
| 39 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Minimal Degree and (k, m)-Pancyclic Ordered Graphs. Graphs and Combinatorics 21(2): 197-211 (2005) | |
| 2004 | ||
| 38 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito: Toughness, degrees and 2-factors. Discrete Mathematics 286(3): 245-249 (2004) | |
| 37 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Generalizing Pancyclic and k-Ordered Graphs. Graphs and Combinatorics 20(3): 291-309 (2004) | |
| 36 | Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West: The Bar Visibility Number of a Graph. SIAM J. Discrete Math. 18(3): 462-471 (2004) | |
| 2002 | ||
| 35 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Characterizing forbidden clawless triples implying hamiltonian graphs. Discrete Mathematics 249(1-3): 71-81 (2002) | |
| 2001 | ||
| 34 | Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris: Tolerance orders and bipartite unit tolerance graphs. Discrete Mathematics 226(1-3): 35-50 (2001) | |
| 33 | Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel: Edge disjoint monochromatic triangles in 2-colored graphs. Discrete Mathematics 231(1-3): 135-141 (2001) | |
| 32 | Ronald J. Gould, Michael S. Jacobson: Two-factors with few cycles in claw-free graphs. Discrete Mathematics 231(1-3): 191-197 (2001) | |
| 2000 | ||
| 31 | Kamal Ali, Isam Taha, Michael S. Jacobson: PC based system for heart rate variability analysis. Computers and Their Applications 2000: 29-32 | |
| 30 | 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. Discrete Mathematics 219(1-3): 17-26 (2000) | |
| 29 | Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs and Combinatorics 16(1): 67-80 (2000) | |
| 28 | Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp: Even Cycles in Graphs with Many Odd Cycles. Graphs and Combinatorics 16(4): 399-410 (2000) | |
| 1999 | ||
| 27 | Guantao Chen, Ronald J. Gould, Michael S. Jacobson: On 2-factors containing 1-factors in bipartite graphs. Discrete Mathematics 197-198: 185-194 (1999) | |
| 1998 | ||
| 26 | Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Scenic Graphs I: Traceable Graphs. Ars Comb. 49: (1998) | |
| 25 | 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) | |
| 24 | Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) | |
| 1997 | ||
| 23 | Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman: On fractional Ramsey numbers. Discrete Mathematics 176(1-3): 159-175 (1997) | |
| 1996 | ||
| 22 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak: Graph spectra. Discrete Mathematics 150(1-3): 103-113 (1996) | |
| 1995 | ||
| 21 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Degree conditions and cycle extendability. Discrete Mathematics 141(1-3): 109-122 (1995) | |
| 20 | Michael S. Jacobson, Jenö Lehel: Irregular embeddings of hypergraphs with fixed chromatic number. Discrete Mathematics 145(1-3): 145-150 (1995) | |
| 19 | Michael S. Jacobson, Jenö Lehel: Irregular embeddings of multigraphs with fixed chromatic number. Discrete Mathematics 145(1-3): 295-299 (1995) | |
| 18 | Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Hamiltonicity in balancedk-partite graphs. Graphs and Combinatorics 11(3): 221-231 (1995) | |
| 1993 | ||
| 17 | Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak: Ø-Threshold and Ø-Tolerance Chain Graphs. Discrete Applied Mathematics 44(1-3): 191-203 (1993) | |
| 16 | Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West: Subtree and Substar Intersection Numbers. Discrete Applied Mathematics 44(1-3): 205-220 (1993) | |
| 15 | Michael S. Jacobson, Kenneth Peters: A Note on Graphs Which Have Upper Irredundance Equal to Independence. Discrete Applied Mathematics 44(1-3): 91-97 (1993) | |
| 1992 | ||
| 14 | 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. Discrete Mathematics 103(1): 17-24 (1992) | |
| 13 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak: Neighborhood unions and a generalization of Dirac's theorem. Discrete Mathematics 105(1-3): 61-71 (1992) | |
| 12 | Michael S. Jacobson: On the p-Edge Clique Cover Number of Complete Bipartite Graphs. SIAM J. Discrete Math. 5(4): 539-544 (1992) | |
| 1991 | ||
| 11 | Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza: Decompositions of regular bipartite graphs. Discrete Mathematics 89(1): 17-27 (1991) | |
| 10 | Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel: Irregularity strength of dense graphs. Discrete Mathematics 91(1): 45-59 (1991) | |
| 1990 | ||
| 9 | John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts: The bondage number of a graph. Discrete Mathematics 86(1-3): 47-57 (1990) | |
| 8 | Michael S. Jacobson, Kenneth Peters: Chordal graphs and upper irredundance, upper domination and independence. Discrete Mathematics 86(1-3): 59-69 (1990) | |
| 1989 | ||
| 7 | Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel: Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Mathematics 76(3): 223-240 (1989) | |
| 6 | 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): 1-9 (1989) | |
| 1988 | ||
| 5 | András Gyárfás, Michael S. Jacobson, Lael F. Kinch: On a generalization of transitivity for digraphs. Discrete Mathematics 69(1): 35-41 (1988) | |
| 1987 | ||
| 4 | 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 and Combinatorics 3(1): 1-6 (1987) | |
| 1982 | ||
| 3 | Michael S. Jacobson: On a generalization of Ramsey theory. Discrete Mathematics 38(2-3): 191-195 (1982) | |
| 2 | Michael S. Jacobson: On the Ramsey multiplicity for stars. Discrete Mathematics 42(1): 63-66 (1982) | |
| 1 | Ronald J. Gould, Michael S. Jacobson: Forbidden subgraphs and Hamiltonian properties of graphs. Discrete Mathematics 42(2-3): 189-196 (1982) | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page