Publications

Preprints of Publications

Stephen G. Hartke and Jennifer Vandenbussche, On a question of Sós about 3-uniform friendship hypergraphs, submitted. dvi | ps | pdf
József Balogh, Stephen G. Hartke, Qi Liu, and Gexin Yu, First-Fit chromatic number of planar and random graphs, submitted. pdf
Michael Ferrara, Ronald Gould, and Stephen G. Hartke, The structure of 2-factors in iterated line graphs, submitted. pdf
Jeong-Ok Choi, Stephen G. Hartke, and Hemanshu Kaul, Distinguishing chromatic number of cartesian products of graphs, in revision. dvi | ps | pdf
Michael D. Barrus, Stephen G. Hartke, and Mohit Kumbhat, Graph classes characterized both by forbidden subgraphs and degree sequences, submitted. dvi | ps | pdf
Stephen G. Hartke, Jennifer Vandenbussche, and Paul Wenger, Further results on bar k-visibility graphs, submitted. dvi | ps | pdf
P. Blue and Stephen G. Hartke, Reverse solitaire: removing an army from the desert. dvi | ps | pdf | web
Stephen G. Hartke and Kathleen Ponto, k-ordered hamiltonicity of iterated line graphs, submitted. dvi | ps | pdf | web
Stephen G. Hartke, Attempting to narrow the integrality gap for the firefighter problem on trees, Discrete Methods in Epidemiology, J.Abello and G.Cormode, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 70 (2006), 179-185. DIMACS volumes | dvi | ps | pdf | web
Mike Develin and Stephen G. Hartke, Fire containment in grids of dimension three and higher, submitted. arXiv math.CO/0409195 | dvi | ps | pdf | web
Stephen G. Hartke, The elimination procedure for the competition number is not optimal, Discrete Applied Math., 154 (2006), no. 11, 1633–1639. dvi | ps | pdf | web
Wiebke S. Diestelkamp, Stephen G. Hartke, and Rachael H. Kenney, On the degree of local permutation polynomials, Journal of Combinatorial Mathematics and Combinatorial Computation, 50 (2004), 129-140. J. Combin. Math. Combin. Comput. (MathSciNet) | Diestelkamp's webpage | ps | pdf | web
Stephen Hartke, The elimination procedure for the phylogeny number, Ars Combinatoria, 75 (2005), 297-311. Ars Combinatoria | dvi | ps | pdf | web
Mike Develin, Stephen Hartke, and David Petrie Moulton, A general notion of visibility graphs, Discrete and Computational Geometry, 29 (2003), no. 4, 511-524. Disc. & Comput. Geom. | Develin's webpage | dvi (no figures) | ps | pdf | web
Stephen G. Hartke and Aparna W. Higgins, Minimum degree growth of the iterated line graph, Ars Combinatoria, 69 (2003), 275-283. Ars Combinatoria | dvi | ps | pdf | web
Danielle Bianco, Olivia M. Carducci, Stephen Hartke, and Anne Larimer, Stable matchings in the couples problem, Morehead Electronic Journal of Applicable Mathematics, Issue 2, MATH-2001-06, January 16, 2002. Morehead Elec. J. of Applicable Math. | ps | pdf | web
Stephen G. Hartke and Aparna W. Higgins, Maximum degree growth of the iterated line graph, The Electronic Journal of Combinatorics, 6 (1999), #R28. The Elec. J. of Comb. | dvi | ps | pdf | web
Stephen G. Hartke, Binary De Bruijn cycles under different equivalence relations, Discrete Mathematics, 215 (2000), 93-102. Disc. Math. | dvi | ps | pdf | web