The SCEAS System
| |||||||

## Search the dblp DataBase
Michael S. Jacobson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kamal Ali, Isam Taha, Michael S. Jacobson
**PC based system for heart rate variability analysis.**[Citation Graph (0, 0)][DBLP] Computers and Their Applications, 2000, pp:29-32 [Conf] - Michael S. Jacobson, André E. Kézdy, Jenö Lehel
**Scenic Graphs I: Traceable Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:49, n:, pp:- [Journal] - Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West
**Subtree and Substar Intersection Numbers.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:205-220 [Journal] - Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
**Ø-Threshold and Ø-Tolerance Chain Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:191-203 [Journal] - Michael S. Jacobson, Kenneth Peters
**A Note on Graphs Which Have Upper Irredundance Equal to Independence.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:91-97 [Journal] - Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris
**Tolerance orders and bipartite unit tolerance graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:226, n:1-3, pp:35-50 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:219, n:1-3, pp:17-26 [Journal] - Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
**Edge disjoint monochromatic triangles in 2-colored graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:231, n:1-3, pp:135-141 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
**Characterizing forbidden clawless triples implying hamiltonian graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:249, n:1-3, pp:71-81 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
**Toughness, degrees and 2-factors.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:3, pp:245-249 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito
**A note on 2-factors with two components.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:300, n:1-3, pp:218-224 [Journal] - Ronald J. Gould, Michael S. Jacobson
**Two-factors with few cycles in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:231, n:1-3, pp:191-197 [Journal] - András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
**Odd cycles and Theta-cycles in hypergraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:19-20, pp:2481-2491 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
**Generalizing Pancyclic and**[Citation Graph (0, 0)][DBLP]*k*-Ordered Graphs. Graphs and Combinatorics, 2004, v:20, n:3, pp:291-309 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
**Minimal Degree and (**[Citation Graph (0, 0)][DBLP]*k, m*)-Pancyclic Ordered Graphs. Graphs and Combinatorics, 2005, v:21, n:2, pp:197-211 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp
**Neighborhood unions and hamiltonian properties in graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:1-9 [Journal] - Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
**Tough enough chordal graphs are Hamiltonian.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:31, n:1, pp:29-38 [Journal] - Michael S. Jacobson, André E. Kézdy, Jenö Lehel
**Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:31, n:1, pp:1-10 [Journal] - Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West
**The Bar Visibility Number of a Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:3, pp:462-471 [Journal] - Michael S. Jacobson
**On the**[Citation Graph (0, 0)][DBLP]*p*-Edge Clique Cover Number of Complete Bipartite Graphs. SIAM J. Discrete Math., 1992, v:5, n:4, pp:539-544 [Journal] - Arthur H. Busch, Michael S. Jacobson, K. B. Reid
**On arc-traceable tournaments.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:2, pp:157-166 [Journal] - Michael S. Jacobson
**On a generalization of Ramsey theory.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:38, n:2-3, pp:191-195 [Journal] - Michael S. Jacobson
**On the Ramsey multiplicity for stars.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:42, n:1, pp:63-66 [Journal] - Ronald J. Gould, Michael S. Jacobson
**Forbidden subgraphs and Hamiltonian properties of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:42, n:2-3, pp:189-196 [Journal] - András Gyárfás, Michael S. Jacobson, Lael F. Kinch
**On a generalization of transitivity for digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:69, n:1, pp:35-41 [Journal] - Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
**Irregular networks, regular graphs and integer matrices with distinct row and column sums.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:76, n:3, pp:223-240 [Journal] - Guantao Chen, Ronald J. Gould, Michael S. Jacobson
**On 2-factors containing 1-factors in bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:185-194 [Journal] - Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman
**On fractional Ramsey numbers.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:176, n:1-3, pp:159-175 [Journal] - John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts
**The bondage number of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:86, n:1-3, pp:47-57 [Journal] - Michael S. Jacobson, Kenneth Peters
**Chordal graphs and upper irredundance, upper domination and independence.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:86, n:1-3, pp:59-69 [Journal] - Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza
**Decompositions of regular bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:89, n:1, pp:17-27 [Journal] - Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
**Irregularity strength of dense graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:91, n:1, pp:45-59 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:1, pp:17-24 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
**Neighborhood unions and a generalization of Dirac's theorem.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:105, n:1-3, pp:61-71 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
**Degree conditions and cycle extendability.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:141, n:1-3, pp:109-122 [Journal] - Michael S. Jacobson, Jenö Lehel
**Irregular embeddings of multigraphs with fixed chromatic number.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:145, n:1-3, pp:295-299 [Journal] - Michael S. Jacobson, Jenö Lehel
**Irregular embeddings of hypergraphs with fixed chromatic number.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:145, n:1-3, pp:145-150 [Journal] - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
**Graph spectra.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:150, n:1-3, pp:103-113 [Journal] **The game of F-saturator.**[Citation Graph (, )][DBLP]**Pancyclic graphs and linear forests.**[Citation Graph (, )][DBLP]**tK**[Citation Graph (, )][DBLP]_{p}-saturated graphs of minimum size.
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |