Stephen G. Hartke

Orcid: 0000-0003-1278-0860

Affiliations:
  • University of Colorado Denver, Department of Mathematical and Statistical Sciences
  • University of Nebraska-Lincoln, Department of Mathematics


According to our database1, Stephen G. Hartke authored at least 44 papers between 1999 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Relation between the correspondence chromatic number and the Alon-Tarsi number.
Discret. Math., June, 2023

2022
A Classification of Hyperfocused 12-Arcs.
Graphs Comb., 2022

2019
Navigating between packings of graphic sequences.
Discret. Appl. Math., 2019

2018
Extending precolorings to distinguish group actions.
Eur. J. Comb., 2018

Uniquely K<sub>r</sub><sup>(k)</sup>-Saturated Hypergraphs.
Electron. J. Comb., 2018

On the Strong Chromatic Index of Sparse Graphs.
Electron. J. Comb., 2018

2017
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three.
SIAM J. Discret. Math., 2017

Graph Realizations Constrained by Skeleton Graphs.
Electron. J. Comb., 2017

2016
Edge-disjoint rainbow spanning trees in complete graphs.
Eur. J. Comb., 2016

On the independence ratio of distance graphs.
Discret. Math., 2016

2015
Non-minimal Degree-Sequence-Forcing Triples.
Graphs Comb., 2015

Minimal forbidden sets for degree sequence characterizations.
Discret. Math., 2015

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

A linear programming approach to the Manickam-Miklós-Singhi conjecture.
Eur. J. Comb., 2014

2013
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs.
SIAM J. Discret. Math., 2013

Extremal Graphs With a Given Number of Perfect Matchings.
J. Graph Theory, 2013

Random partitions and edge-disjoint Hamiltonian cycles.
J. Comb. Theory, Ser. B, 2013

List distinguishing parameters of trees.
Discret. Appl. Math., 2013

A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture
CoRR, 2013

New Results on Degree Sequences of Uniform Hypergraphs.
Electron. J. Comb., 2013

2012
Graphic Sequences Have Realizations Containing Bisections of Large Degree.
J. Graph Theory, 2012

Packing of graphic <i>n</i>-tuples.
J. Graph Theory, 2012

Reconstructing a Graph from its Arc Incidence Graph.
Graphs Comb., 2012

Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps.
Discret. Math., 2012

On the hardness of recognizing triangular line graphs.
Discret. Math., 2012

Uniquely K_r-Saturated Graphs
CoRR, 2012

Uniquely K<sub>r</sub>-Saturated Graphs.
Electron. J. Comb., 2012

2010
Distinguishing Chromatic Number of Cartesian Products of Graphs.
SIAM J. Discret. Math., 2010

Automorphism Groups of a Graph and a Vertex-Deleted Subgraph.
Electron. J. Comb., 2010

2009
k-ordered hamiltonicity of iterated line graphs.
Discret. Math., 2009

A Note on Divisibility of the Number of Matchings of a Family of Graphs.
Electron. J. Comb., 2009

2008
On the First-Fit Chromatic Number of Graphs.
SIAM J. Discret. Math., 2008

Graph classes characterized both by forbidden subgraphs and degree sequences.
J. Graph Theory, 2008

The hub number of a graph.
Inf. Process. Lett., 2008

2007
Further Results on Bar k-Visibility Graphs.
SIAM J. Discret. Math., 2007

The structure and existence of 2-factors in iterated line graphs.
Discuss. Math. Graph Theory, 2007

Fire containment in grids of dimension three and higher.
Discret. Appl. Math., 2007

2006
The elimination procedure for the competition number is not optimal.
Discret. Appl. Math., 2006

2005
The Elimination Procedure for the Phylogeny Number.
Ars Comb., 2005

2004
Attempting to Narrow the Integrality Gap for the Firefighter Problem on Trees.
Proceedings of the Discrete Methods in Epidemiology, 2004

2003
A General Notion of Visibility Graphs.
Discret. Comput. Geom., 2003

Minimum Degree Growth of the Iterated Line Graph.
Ars Comb., 2003

2000
Binary De Bruijn cycles under different equivalence relations.
Discret. Math., 2000

1999
Maximum Degree Growth of the Iterated Line Graph.
Electron. J. Comb., 1999


  Loading...