Michael S. Jacobson

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


On csauthors.net:


Gaps in the saturation spectrum of trees.
Discussiones Mathematicae Graph Theory, 2019

Degree sum and vertex dominating paths.
Journal of Graph Theory, 2018

Minimum Degree and Dominating Paths.
Journal of Graph Theory, 2017

Saturation spectrum of paths and stars.
Discussiones Mathematicae Graph Theory, 2017

Degree Conditions for Spanning Brooms.
Journal of Graph Theory, 2014

A Degree Sequence Variant of Graph Ramsey Numbers.
Graphs and Combinatorics, 2014

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs.
Graphs and Combinatorics, 2013

Minimum degree and disjoint cycles in generalized claw-free graphs.
Eur. J. Comb., 2013

Weak saturation numbers for sparse graphs.
Discussiones Mathematicae Graph Theory, 2013

Degree Conditions for H-Linked Digraphs.
Combinatorics, Probability & Computing, 2013

Saturation numbers for families of graph subdivisions.
Journal of Graph Theory, 2012

New Ore-Type Conditions for H-Linked Graphs.
Journal of Graph Theory, 2012

Distributing vertices on Hamiltonian cycles.
Journal of Graph Theory, 2012

Packing of graphic n-tuples.
Journal of Graph Theory, 2012

Characterizing degree-sum maximal nonhamiltonian bipartite graphs.
Discrete Mathematics, 2012

Minimum Degree and Disjoint Cycles in Claw-Free Graphs.
Combinatorics, Probability & Computing, 2012

Transitive partitions in realizations of tournament score sequences.
Journal of Graph Theory, 2010

Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum.
Graphs and Combinatorics, 2010

Chvátal-Erdös type theorems.
Discussiones Mathematicae Graph Theory, 2010

The game of F-saturator.
Discrete Applied Mathematics, 2010

Hamiltonian cycles avoiding sets of edges in a graph.
Australasian J. Combinatorics, 2010

Ramsey numbers in rainbow triangle free colorings.
Australasian J. Combinatorics, 2010

Potentially H-bigraphic sequences.
Discussiones Mathematicae Graph Theory, 2009

Pancyclic graphs and linear forests.
Discrete Mathematics, 2009

tKp-saturated graphs of minimum size.
Discrete Mathematics, 2009

Saturation Numbers for Trees.
Electr. J. Comb., 2009

Cycle Extendability of Hamiltonian Interval Graphs.
SIAM J. Discrete Math., 2006

On arc-traceable tournaments.
Journal of Graph Theory, 2006

Odd cycles and Theta-cycles in hypergraphs.
Discrete Mathematics, 2006

Minimal Degree and (k, m)-Pancyclic Ordered Graphs.
Graphs and Combinatorics, 2005

Potential forbidden triples implying hamiltonicity: for sufficiently large graphs.
Discussiones Mathematicae Graph Theory, 2005

On a conjecture of Quintas and arc-traceability in upset tournaments.
Discussiones Mathematicae Graph Theory, 2005

A note on 2-factors with two components.
Discrete Mathematics, 2005

The Bar Visibility Number of a Graph.
SIAM J. Discrete Math., 2004

Generalizing Pancyclic and k-Ordered Graphs.
Graphs and Combinatorics, 2004

Forbidden triples implying Hamiltonicity: for all graphs.
Discussiones Mathematicae Graph Theory, 2004

Linear forests and ordered cycles.
Discussiones Mathematicae Graph Theory, 2004

Toughness, degrees and 2-factors.
Discrete Mathematics, 2004

On non-z(mod k) dominating sets.
Discussiones Mathematicae Graph Theory, 2003

Fragile graphs with small independent cuts.
Journal of Graph Theory, 2002

Characterizing forbidden clawless triples implying hamiltonian graphs.
Discrete Mathematics, 2002

Destroying symmetry by orienting edges: Complete graphs and complete bigraphs.
Discussiones Mathematicae Graph Theory, 2001

Two-factors with few cycles in claw-free graphs.
Discrete Mathematics, 2001

Edge disjoint monochromatic triangles in 2-colored graphs.
Discrete Mathematics, 2001

Tolerance orders and bipartite unit tolerance graphs.
Discrete Mathematics, 2001

On k-ordered graphs.
Journal of Graph Theory, 2000

Even Cycles in Graphs with Many Odd Cycles.
Graphs and Combinatorics, 2000

Cycles in 2-Factors of Balanced Bipartite Graphs.
Graphs and Combinatorics, 2000

Clique covering the edges of a locally cobipartite graph.
Discrete Mathematics, 2000

PC based system for heart rate variability analysis.
Proceedings of the ISCA 15th International Conference Computers and Their Applications, 2000

Generalized Ramsey theory and decomposable properties of graphs.
Discussiones Mathematicae Graph Theory, 1999

On 2-factors containing 1-factors in bipartite graphs.
Discrete Mathematics, 1999

Scenic graphs II: non-traceable graphs.
Australasian J. Combinatorics, 1999

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

Tough enough chordal graphs are Hamiltonian.
Networks, 1998

Note on graphs without repeated cycle lengths.
Journal of Graph Theory, 1998

Scenic Graphs I: Traceable Graphs.
Ars Comb., 1998

Recognizing Intersection Graphs of Linear Uniform Hypergraphs.
Graphs and Combinatorics, 1997

Degree Sum Conditions for Hamiltonicity on k-Partite Graphs.
Graphs and Combinatorics, 1997

On fractional Ramsey numbers.
Discrete Mathematics, 1997

Graph spectra.
Discrete Mathematics, 1996

The 2-intersection number of paths and bounded-degree trees.
Journal of Graph Theory, 1995

Hamiltonicity in balancedk-partite graphs.
Graphs and Combinatorics, 1995

Spanning caterpllars with bounded diameter.
Discussiones Mathematicae Graph Theory, 1995

Irregular embeddings of multigraphs with fixed chromatic number.
Discrete Mathematics, 1995

Irregular embeddings of hypergraphs with fixed chromatic number.
Discrete Mathematics, 1995

Degree conditions and cycle extendability.
Discrete Mathematics, 1995

Neighborhood unions and the cycle cover number of a graph.
Journal of Graph Theory, 1994

A Note on Graphs Which Have Upper Irredundance Equal to Independence.
Discrete Applied Mathematics, 1993

Ø-Threshold and Ø-Tolerance Chain Graphs.
Discrete Applied Mathematics, 1993

Subtree and Substar Intersection Numbers.
Discrete Applied Mathematics, 1993

On the p-Edge Clique Cover Number of Complete Bipartite Graphs.
SIAM J. Discrete Math., 1992

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

Neighborhood unions and a generalization of Dirac's theorem.
Discrete Mathematics, 1992

General results on tolerance intersection graphs.
Journal of Graph Theory, 1991

Decompositions of regular bipartite graphs.
Discrete Mathematics, 1991

Irregularity strength of dense graphs.
Discrete Mathematics, 1991

Lower bounds for lower Ramsey numbers.
Journal of Graph Theory, 1990

Chordal graphs and upper irredundance, upper domination and independence.
Discrete Mathematics, 1990

The bondage number of a graph.
Discrete Mathematics, 1990

Neighborhood unions and hamiltonian properties in graphs.
J. Comb. Theory, Ser. B, 1989

On a Neighborhood Condition Implying the Existence of Disjoint Complete Graphs.
Eur. J. Comb., 1989

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

On a generalization of transitivity for digraphs.
Discrete Mathematics, 1988

Extremal problems involving neighborhood unions.
Journal of Graph Theory, 1987

Goodness of trees for generalized books.
Graphs and Combinatorics, 1987

On the domination of the products of graphs II: Trees.
Journal of Graph Theory, 1986

Forbidden subgraphs and hamiitonian properties in the square of a connected graph.
Journal of Graph Theory, 1984

On the Ramsey number of trees versus graphs with large clique number.
Journal of Graph Theory, 1983

Bounds for the ramsey number of a disconnected graph versus any graph.
Journal of Graph Theory, 1982

On the Ramsey multiplicity for stars.
Discrete Mathematics, 1982

On a generalization of Ramsey theory.
Discrete Mathematics, 1982

Forbidden subgraphs and Hamiltonian properties of graphs.
Discrete Mathematics, 1982

A note on Ramsey multiplicity.
Discrete Mathematics, 1980