| 2008 |
|---|
| 11 | EE | Tracy Grauman,
Stephen G. Hartke,
Adam Jobson,
Bill Kinnersley,
Douglas B. West,
Lesley Wiglesworth,
Pratik Worah,
Hehui Wu:
The hub number of a graph.
Inf. Process. Lett. 108(4): 226-228 (2008) |
| 10 | EE | 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) |
| 9 | EE | 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 |
|---|
| 8 | EE | Mike Develin,
Stephen G. Hartke:
Fire containment in grids of dimension three and higher.
Discrete Applied Mathematics 155(17): 2257-2268 (2007) |
| 7 | EE | 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 | EE | 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 | EE | Mike Develin,
Stephen G. Hartke,
David Petrie Moulton:
A General Notion of Visibility Graphs.
Discrete & Computational Geometry 29(4): 511-524 (2003) |
| 2000 |
|---|
| 2 | EE | Stephen G. Hartke:
Binary De Bruijn cycles under different equivalence relations.
Discrete Mathematics 215: 93-102 (2000) |
| 1999 |
|---|
| 1 | EE | Stephen G. Hartke,
Aparna W. Higgins:
Maximum Degree Growth of the Iterated Line Graph.
Electr. J. Comb. 6: (1999) |
