Publications

Curriculum Vitae for Stephen G. Hartke

Research Publications:

45. Susan M. Cooper and Stephen G. Hartke, The alpha problem and line count configurations, submitted 2012 to J. Algebra. To be refereed, 19pp. pdf.
44. Stephen G. Hartke and Derrick Stolee, Uniquely K_r-saturated graphs, submitted 2012 to Elec. J. Combin. To be refereed, 35pp. pdf.
43. Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, and Paul S. Wenger, List distinguishing parameters of trees, submitted 2012 to Disc. Appl. Math. To be refereed, 11pp. pdf.
42. Stephen G. Hartke and Tyler Seacrest, Random partitions and edge-disjoint Hamiltonian cycles, submitted 2011 to J. Combin. Theory B. To be refereed, 24pp. pdf.
41. Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew Yancey, Extremal graphs with a given number of perfect matchings, submitted 2011 to J. Graph Theory. To be refereed, 22pp. pdf.
40. Stephen G. Hartke and A.J. Radcliffe, Signatures of Strings, accepted 2011 to Annals of Combinatorics. Refereed, 18pp. pdf.
39. Shant Karakashian, Berthe Y. Choueiry, Stephen G. Hartke, An Algorithm for Generating All Connected Subgraphs of k Vertices of a Graph, submitted 2010 to Journal of the ACM. To be refereed, 30 pp. pdf.
38. Arthur Busch, Michael Ferrara, Stephen G. Hartke, and Michael Jacobson, Ramsey-type numbers for degree sequences, submitted 2010 to Discrete Math. To be refereed, 11 pp. pdf.
37. Stephen G. Hartke, Ryan Martin, and Tyler Seacrest, Relating minimum degree and the existence of a k-factor, research manuscript, 11pp. pdf.
36. Michael D. Barrus, Stephen G. Hartke, Kyle F. Jao, Douglas B. West, Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps, Discrete Math., 312 (2012), 1494–1501. pdf.
35. Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, and Derrick Stolee, On the hardness of recognizing triangular line graphs, accepted 2011 to Discrete Math. Refereed, 20pp. pdf.
34. Stephen G. Hartke and Tyler Seacrest, Graphic sequences have realizations containing bisections of large degree, accepted 2011 to J. Graph Theory. Refereed, 16pp. pdf.
33. Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, and Douglas B. West, Packing of graphic n-tuples, J. Graph Theory, accepted 2010, 11pp. pdf.
32. Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, and Derrick Stolee, Automorphism groups of a graph and a vertex-deleted subgraph, Electron. J. Combin., 17 (2010), no. 1, R134, 8pp. MR2729383. pdf.
31. Stephen G. Hartke and Geir T. Helleloid, Reconstructing a graph from its arc incidence graph, accepted 2011 to Graphs and Combinatorics. Refereed, 16pp. pdf.
30. Michael D. Barrus, Stephen G. Hartke, and Mohit Kumbhat, Non-minimal degree-sequence-forcing triples, submitted 2010 to Graphs and Combinatorics. To be refereed, 28pp. pdf.
29. S. G. Hartke, P. R. J. Östergård, D. Bryant, and S. I. El-Zanati, The nonexistence of a (K₆−e)-decomposition of the complete graph K₂₉, J. Combinatorial Designs, 18 (2010), no. 2, 94–104. MR2604635. pdf.
28. Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bill Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, and Hehui Wu, The hub number of a graph, Information Processing Letters, 108 (2008), 226–228. MR2457930. pdf.
26. Stephen G. Hartke and A. J. Radcliffe, McKay’s canonical graph labeling algorithm, Communicating Mathematics: In Honor of Joseph A. Gallian’s 65th Birthday, AMS Contemporary Mathematics book series, vol 479, Timothy Y. Chow and Daniel C. Isaksen, eds., 2009, 99–111. Expository. MR2513360. pdf.
25. Oleg V. Borodin, Stephen G. Hartke, Anna O. Ivanova, Alexandr V. Kostochka, and Douglas B. West, (5,2)-coloring of sparse graphs, Siberian Electron. Math. Reports, 5 (2008), 417–426. MR2586647. pdf. Available at http://semr.math.nsc.ru.
24. Stephen G. Hartke and Jennifer Vandenbussche, On a question of Sós about 3-uniform friendship hypergraphs, J. Combinatorial Designs, 16 (2008), no. 3, 253–261. MR2404483. pdf.
23. József Balogh, Stephen G. Hartke, Qi Liu, and Gexin Yu, First-Fit chromatic number of planar and random graphs, SIAM J. Discrete Math., 22 (2008), no. 3, 887–900. MR2424828. pdf.
21. Michael Ferrara, Ronald Gould, and Stephen G. Hartke, The structure of 2-factors in iterated line graphs, Discuss. Math. Graph Theory, 27 (2007), no. 3, 507–526. MR2412361. pdf.
20. Kyung-Won Hwang, Naeem N. Sheikh, and Stephen G. Hartke, A note on divisibility of the number of matchings of a family of graphs, Electron. J. Combin., 16 (2009), no. 1, N10. MR2491650. pdf.
19. Jeong-Ok Choi, Stephen G. Hartke, and Hemanshu Kaul, Distinguishing chromatic number of cartesian products of graphs, SIAM J. of Discrete Math., 24 (2010), no. 1, 82–100. MR2600654. pdf.
18. Michael D. Barrus, Stephen G. Hartke, and Mohit Kumbhat, Graph classes characterized both by forbidden subgraphs and degree sequences, J. Graph Theory, 57 (2008), no. 2, 131–148. MR2374237. pdf.
17. Stephen G. Hartke, Jennifer Vandenbussche, and Paul Wenger, Further results on bar k-visibility Graphs, SIAM J. of Discrete Math., 21 (2007), no. 2, 523–531. MR2318682. pdf.
16. Stephen G. Hartke and Kathleen Ponto, k-ordered hamiltonicity of iterated line graphs, Discrete Math., 309 (2009), 1491–1497. MR2510555. pdf.
12. 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. MR2241660. pdf. DIMACS volumes.
11. Mike Develin and Stephen G. Hartke, Fire containment in grids of dimension three and higher, Discrete Applied Math., 155 (2007), no. 17, 2257–2268. MR2360655. pdf.
10. Stephen G. Hartke, The voter model with confidence levels, DIMACS Technical Report 2003-45, 16pp. Unrefereed. pdf. DIAMCS tech reports.
9. Stephen G. Hartke, The elimination procedure for the competition number is not optimal, Discrete Applied Math., 154 (2006), no. 11, 1633–1639. MR2229436. pdf.
8. Wiebke S. Diestelkamp, Stephen G. Hartke, and Rachael H. Kenney, On the degree of local permutation polynomials, J. of Combin. Math. and Combin. Comput., 50 (2004), 129–140. MR2075862. pdf.
7. Stephen Hartke, The elimination procedure for the phylogeny number, Ars Combinatoria, 75 (2005), 297–311. MR2133230. pdf.
6. Mike Develin, Stephen Hartke, and David Petrie Moulton, A general notion of visibility graphs, Discrete and Comput. Geom., 29 (2003), no. 4, 511–524. MR1976604. pdf.
5. Stephen G. Hartke and Aparna W. Higgins, Minimum degree growth of the iterated line graph, Ars Combinatoria, 69 (2003), 275–283. MR2007659. pdf.
3. Danielle Bianco, Olivia M. Carducci, Stephen Hartke, and Anne Larimer, Stable matchings in the couples problem, Morehead Electron. J. of Applicable Math., Issue 2, MATH–2001–06, January 16, 2002. pdf.
2. Stephen G. Hartke and Aparna W. Higgins, Maximum degree growth of the iterated line graph, Electron. J. Combin., 6 (1999), R28. MR1696913. pdf.
1. Stephen G. Hartke, Binary De Bruijn cycles under different equivalence relations, Discrete Math., 215 (2000), 93–102. MR1746451. pdf.

Other Publications:

27. Stephen G. Hartke and A. J. Radcliffe, Solution to problem #11336 proposed by Donald Knuth, listed as alternate solution, Amer. Math. Monthly, 116 (2009), no. 9, 848–849. pdf.
22. Stephen G. Hartke, Daniel C. Isaksen, and Philip Matchett Wood, Graduate students as mentors in mathematics REUs, Proc. of the Conference on Promoting Undergraduate Research in Mathematics, J.A. Gallian, ed., Amer. Math. Society (2007), 285–287. pdf. webpage.
15. Stephen G. Hartke, Eine Übersicht freier Mathematikfonts für TeX und LaTeX, translated by Martin Sievers, Die TeXnische Komödie, 4 (2006), 17–36.
14. Stephen G. Hartke, A survey of free math fonts for TeX and LaTeX, The PracTeX Journal, (2006) no. 1. pdf. webpage.
4. Stephen G. Hartke, Summer mathematics research experiences, Proc. of the Conf. on Summer Undergrad. Math. Research Programs, J.A. Gallian, ed., Amer. Math. Society (2000), 267–271. pdf. webpage.