 | 2012 |
| 18 |  | Stephen G. Hartke,
Derrick Stolee:
Uniquely K_r-Saturated Graphs
CoRR abs/1203.1084: (2012) |
| 17 |  | 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 |
| 16 |  | Stephen G. Hartke,
Hannah Kolb,
Jared Nishikawa,
Derrick Stolee:
Automorphism Groups of a Graph and a Vertex-Deleted Subgraph.
Electr. J. Comb. 17(1): (2010) |
| 15 |  | Jeong Ok Choi,
Stephen G. Hartke,
Hemanshu Kaul:
Distinguishing Chromatic Number of Cartesian Products of Graphs.
SIAM J. Discrete Math. 24(1): 82-100 (2010) |
| 2009 |
| 14 |  | Stephen G. Hartke,
Kathleen Ponto:
k-ordered hamiltonicity of iterated line graphs.
Discrete Mathematics 309(6): 1491-1497 (2009) |
| 13 |  | Kyung-Won Hwang,
Naeem N. Sheikh,
Stephen G. Hartke:
A Note on Divisibility of the Number of Matchings of a Family of Graphs.
Electr. J. Comb. 16(1): (2009) |
| 2008 |
| 12 |  | Tracy Grauman,
Stephen G. Hartke,
Adam Jobson,
William B. Kinnersley,
Douglas B. West,
Lesley Wiglesworth,
Pratik Worah,
Hehui Wu:
The hub number of a graph.
Inf. Process. Lett. 108(4): 226-228 (2008) |
| 11 |  | Michael D. Barrus,
Mohit Kumbhat,
Stephen G. Hartke:
Graph classes characterized both by forbidden subgraphs and degree sequences.
Journal of Graph Theory 57(2): 131-148 (2008) |
| 10 |  | József Balogh,
Stephen G. Hartke,
Qi Liu,
Gexin Yu:
On the First-Fit Chromatic Number of Graphs.
SIAM J. Discrete Math. 22(3): 887-900 (2008) |
| 2007 |
| 9 |  | Mike Develin,
Stephen G. Hartke:
Fire containment in grids of dimension three and higher.
Discrete Applied Mathematics 155(17): 2257-2268 (2007) |
| 8 |  | Michael J. Ferrara,
Ronald J. Gould,
Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs.
Discussiones Mathematicae Graph Theory 27(3): 507-526 (2007) |
| 7 |  | Stephen G. Hartke,
Jennifer Vandenbussche,
Paul Wenger:
Further Results on Bar k-Visibility Graphs.
SIAM J. Discrete Math. 21(2): 523-531 (2007) |
| 2006 |
| 6 |  | Stephen G. Hartke:
The elimination procedure for the competition number is not optimal.
Discrete Applied Mathematics 154(11): 1633-1639 (2006) |
| 2005 |
| 5 |  | Stephen G. Hartke:
The Elimination Procedure for the Phylogeny Number.
Ars Comb. 75: (2005) |
| 2003 |
| 4 |  | Stephen G. Hartke,
Aparna W. Higgins:
Minimum Degree Growth of the Iterated Line Graph.
Ars Comb. 69: (2003) |
| 3 |  | Mike Develin,
Stephen G. Hartke,
David Petrie Moulton:
A General Notion of Visibility Graphs.
Discrete & Computational Geometry 29(4): 511-524 (2003) |
| 2000 |
| 2 |  | Stephen G. Hartke:
Binary De Bruijn cycles under different equivalence relations.
Discrete Mathematics 215: 93-102 (2000) |
| 1999 |
| 1 |  | Stephen G. Hartke,
Aparna W. Higgins:
Maximum Degree Growth of the Iterated Line Graph.
Electr. J. Comb. 6: (1999) |