Maximum Degree Growth of the Iterated Line Graph. - Stephen G. Hartke; Aparna W. Higgins (Electron. J. Comb., 1999)

Binary De Bruijn cycles under different equivalence relations. - Stephen G. Hartke (Discret. Math., 2000)

Minimum Degree Growth of the Iterated Line Graph. - Stephen G. Hartke; Aparna W. Higgins (Ars Comb., 2003)

A General Notion of Visibility Graphs. - Mike Develin; Stephen G. Hartke; David Petrie Moulton (Discret. Comput. Geom., 2003)

Attempting to Narrow the Integrality Gap for the Firefighter Problem on Trees. - Stephen G. Hartke (Discrete Methods in Epidemiology, 2004)

The Elimination Procedure for the Phylogeny Number. - Stephen G. Hartke (Ars Comb., 2005)

The elimination procedure for the competition number is not optimal. - Stephen G. Hartke (Discret. Appl. Math., 2006)

Fire containment in grids of dimension three and higher. - Mike Develin; Stephen G. Hartke (Discret. Appl. Math., 2007)

The structure and existence of 2-factors in iterated line graphs. - Michael J. Ferrara; Ronald J. Gould; Stephen G. Hartke (Discuss. Math. Graph Theory, 2007)

Further Results on Bar k-Visibility Graphs. - Stephen G. Hartke; Jennifer Vandenbussche; Paul S. Wenger (SIAM J. Discret. Math., 2007)

The hub number of a graph. - Tracy Grauman; Stephen G. Hartke; Adam S. Jobson; William B. Kinnersley; Douglas B. West; Lesley Wiglesworth; Pratik Worah; Hehui Wu (Inf. Process. Lett., 2008)

Graph classes characterized both by forbidden subgraphs and degree sequences. - Michael D. Barrus; Mohit Kumbhat; Stephen G. Hartke (J. Graph Theory, 2008)

On the First-Fit Chromatic Number of Graphs. - József Balogh; Stephen G. Hartke; Qi Liu; Gexin Yu (SIAM J. Discret. Math., 2008)

A Note on Divisibility of the Number of Matchings of a Family of Graphs. - Kyung-Won Hwang; Naeem N. Sheikh; Stephen G. Hartke (Electron. J. Comb., 2009)

k-ordered hamiltonicity of iterated line graphs. - Stephen G. Hartke; Kathleen Ponto (Discret. Math., 2009)

Automorphism Groups of a Graph and a Vertex-Deleted Subgraph. - Stephen G. Hartke; Hannah Kolb; Jared Nishikawa; Derrick Stolee (Electron. J. Comb., 2010)

Distinguishing Chromatic Number of Cartesian Products of Graphs. - Jeong Ok Choi; Stephen G. Hartke; Hemanshu Kaul (SIAM J. Discret. Math., 2010)

Uniquely Kr-Saturated Graphs. - Stephen G. Hartke; Derrick Stolee (Electron. J. Comb., 2012)

Uniquely K_r-Saturated Graphs - Stephen G. Hartke; Derrick Stolee (CoRR, 2012)

On the hardness of recognizing triangular line graphs. - Pranav Anand; Henry Escuadro; Ralucca Gera; Stephen G. Hartke; Derrick Stolee (Discret. Math., 2012)

Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps. - Michael D. Barrus; Stephen G. Hartke; Kyle F. Jao; Douglas B. West (Discret. Math., 2012)

Reconstructing a Graph from its Arc Incidence Graph. - Stephen G. Hartke; Geir T. Helleloid (Graphs Comb., 2012)

Packing of graphic n-tuples. - Arthur H. Busch; Michael J. Ferrara; Stephen G. Hartke; Michael S. Jacobson; Hemanshu Kaul; Douglas B. West (J. Graph Theory, 2012)

Graphic Sequences Have Realizations Containing Bisections of Large Degree. - Stephen G. Hartke; Tyler Seacrest (J. Graph Theory, 2012)

New Results on Degree Sequences of Uniform Hypergraphs. - Sarah Behrens; Catherine Erbes; Michael Ferrara; Stephen G. Hartke; Benjamin Reiniger; Hannah Spinoza; Charles Tomlinson (Electron. J. Comb., 2013)

A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture - Stephen G. Hartke; Derrick Stolee (CoRR, 2013)

List distinguishing parameters of trees. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Discret. Appl. Math., 2013)

Random partitions and edge-disjoint Hamiltonian cycles. - Stephen G. Hartke; Tyler Seacrest (J. Comb. Theory B, 2013)

Extremal Graphs With a Given Number of Perfect Matchings. - Stephen G. Hartke; Derrick Stolee; Douglas B. West; Matthew P. Yancey (J. Graph Theory, 2013)

Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs. - James M. Carraher; Stephen G. Hartke (SIAM J. Discret. Math., 2013)

A linear programming approach to the Manickam-Miklós-Singhi conjecture. - Stephen G. Hartke; Derrick Stolee (Eur. J. Comb., 2014)

A Degree Sequence Variant of Graph Ramsey Numbers. - Arthur H. Busch; Michael Ferrara; Stephen G. Hartke; Michael S. Jacobson (Graphs Comb., 2014)

Minimal forbidden sets for degree sequence characterizations. - Michael D. Barrus; Stephen G. Hartke (Discret. Math., 2015)

Non-minimal Degree-Sequence-Forcing Triples. - Michael D. Barrus; Stephen G. Hartke; Mohit Kumbhat (Graphs Comb., 2015)

On the independence ratio of distance graphs. - James M. Carraher; David J. Galvin; Stephen G. Hartke; A. J. Radcliffe; Derrick Stolee (Discret. Math., 2016)

Edge-disjoint rainbow spanning trees in complete graphs. - James M. Carraher; Stephen G. Hartke; Paul Horn (Eur. J. Comb., 2016)

Graph Realizations Constrained by Skeleton Graphs. - Péter L. Erdös; Stephen G. Hartke; Leo van Iersel; István Miklós (Electron. J. Comb., 2017)

Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three. - James M. Carraher; Stephen G. Hartke (SIAM J. Discret. Math., 2017)

On the Strong Chromatic Index of Sparse Graphs. - Philip DeOrsey; Michael Ferrara; Nathan Graber; Stephen G. Hartke; Luke L. Nelsen; Eric Sullivan; Sogol Jahanbekam; Bernard Lidický; Derrick Stolee; Jennifer White (Electron. J. Comb., 2018)

Uniquely Kr(k)-Saturated Hypergraphs. - András Gyárfás; Stephen G. Hartke; Charles Viss (Electron. J. Comb., 2018)

Extending precolorings to distinguish group actions. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Eur. J. Comb., 2018)

Navigating between packings of graphic sequences. - Péter L. Erdös; Michael Ferrara; Stephen G. Hartke (Discret. Appl. Math., 2019)

A Classification of Hyperfocused 12-Arcs. - Philip DeOrsey; Stephen G. Hartke; Jason Williford (Graphs Comb., 2022)

Relation between the correspondence chromatic number and the Alon-Tarsi number. - Eric Culver; Stephen G. Hartke (Discret. Math., 2023)

Trail Trap: a variant of Partizan Edge Geography. - Calum Buchanan; MacKenzie Carr; Alexander Clifton; Stephen G. Hartke; Vesna Irsic; Nicholas Sieger; Rebecca Whitman (CoRR, 2024)

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs. - James Anderson; Herman Chau; Eun-Kyung Cho; Nicholas Crawford; Stephen G. Hartke; Emily Heath; Owen Henderschedt; Hyemin Kwon; Zhiyuan Zhang (Discret. Math., 2025)

Trail Trap: A variant of Partizan Edge Geography. - Calum Buchanan; MacKenzie Carr; Alexander Clifton; Stephen G. Hartke; Vesna Irsic Chenoweth; Nicholas Sieger; Rebecca Whitman (Discret. Appl. Math., 2026)