Peer-Reviewed Publications

2016 | James M. Carraher, David Galvin, Stephen G. Hartke, A. J. Radcliffe, and Derrick Stolee, On the independence ratio of distance graphs, Discrete Math., 339, no. 12, 3058–3072. MR3533354. doi. arXiv:1401.7183. |

2016 | James M. Carraher, Stephen G. Hartke, and Paul Horn, Edge-disjoint rainbow spanning trees in complete graphs, European J. Combin., 57, 71–84. MR3508008. doi. pdf. |

2015 | Michael D. Barrus and Stephen G. Hartke, Minimal forbidden sets for degree sequence characterizations, Discrete Math., 338, no. 9, 1543–1554. MR3345589. doi. pdf. |

2015 | Michael D. Barrus, Stephen G. Hartke, and Mohit Kumbhat, Non-minimal degree-sequence-forcing triples, Graphs and Combin., 31, no. 5, 1189–1209. MR3386003. doi. pdf. |

2014 | Stephen G. Hartke and Derrick Stolee, A linear programming approach to the Manickam-Miklós-Singhi conjecture, European J. of Combinatorics, 36, 53–70. MR3131874. doi. pdf. |

2014 | Susan M. Cooper and Stephen G. Hartke, The alpha problem and line count configurations, J. Algebra, 407, 224–245. MR3197159. doi. pdf. |

2014 | Arthur Busch, Michael Ferrara, Stephen G. Hartke, and Michael Jacobson, A degree sequence variant of graph Ramsey numbers, Graphs and Combinatorics, 30, no. 4, 847–859. MR3223948. doi. pdf. |

2013 | Sarah Behrens, Catherine Erbes, Michael Ferrara, Stephen G. Hartke, Ben Reiniger, Hannah Spinoza, and Charles Tomlinson, New results on degree sequences of uniform hypergraphs, Elec. J. Combin., 20, no. 4, P14, 18pp. web. pdf. |

2013 | James M. Carraher and Stephen G. Hartke, Eulerian circuits with no monochromatic transitions, SIAM J. Disc. Math., 27, no. 4, 1924–1939. MR3123824. doi. pdf. |

2013 | Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, and Paul S. Wenger, List distinguishing parameters of trees, Disc. Appl. Math., 161, 864–869. MR3027977. doi. pdf. |

2013 | Stephen G. Hartke and Tyler Seacrest, Random partitions and edge-disjoint Hamiltonian cycles, J. Combin. Theory B, 103, no. 6, 742–766. MR3127592. doi. pdf. |

2013 | Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew Yancey, Extremal graphs with a given number of perfect matchings, J. Graph Theory, 73, no. 4, 449–468. MR3065114. doi. pdf. |

2013 | Stephen G. Hartke and A.J. Radcliffe, Signatures of strings, Annals of Combinatorics, 17, no. 1, 131–150. MR3027576. doi. pdf. |

2012 | Stephen G. Hartke and Derrick Stolee, Uniquely K_{r}-saturated graphs, Elec. J. Combin., 19, no. 4, P6, 39pp.
MR3001643. web. pdf. |

2012 | 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, 1494–1501. MR2899881. doi. pdf. |

2012 | Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, and Derrick Stolee, On the hardness of recognizing triangular line graphs, Discrete Math., 312, no. 17, 2627–2638. MR2935414. doi. pdf. |

2012 | Stephen G. Hartke and Tyler Seacrest, Graphic sequences have realizations containing bisections of large degree, J. Graph Theory, 71, no. 4, 386–401. MR2988881. doi. pdf. |

2012 | 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, 70, no. 1, 29–39. MR2916065. doi. pdf. |

2012 | Stephen G. Hartke and Geir T. Helleloid, Reconstructing a graph from its arc incidence graph, Graphs and Combinatorics, 28, no. 5, 637–652. MR2964779. doi. pdf. |

2010 | Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, and Derrick Stolee, Automorphism groups of a graph and a vertex-deleted subgraph, Electron. J. Combin., 17, no. 1, R134, 8pp. MR2729383. web. pdf. |

2010 | S. G. Hartke, P. R. J. Östergård, D. Bryant, and S. I. El-Zanati, The nonexistence of a (K_{6}−e)-decomposition of the complete graph K_{29}, J. Combinatorial Designs, 18, no. 2, 94–104.
MR2604635. doi. pdf. |

2010 | Jeong-Ok Choi, Stephen G. Hartke, and Hemanshu Kaul, Distinguishing chromatic number of cartesian products of graphs, SIAM J. of Discrete Math., 24, no. 1, 82–100. MR2600654. doi. pdf. |

2009 | 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., 99–111. Expository. MR2513360. pdf. |

2009 | 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, no. 1, N10. MR2491650. web. pdf. |

2009 | Stephen G. Hartke and Kathleen Ponto, k-ordered hamiltonicity of iterated line graphs, Discrete Math., 309, 1491–1497.
MR2510555. doi. pdf. |

2008 | 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, 226–228. MR2457930. doi. pdf. |

2008 | 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, 417–426. MR2586647. web. pdf. |

2008 | Stephen G. Hartke and Jennifer Vandenbussche, On a question of Sós about 3-uniform friendship hypergraphs, J. Combinatorial Designs, 16, no. 3, 253–261. MR2404483. doi. pdf. |

2008 | 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, no. 3, 887–900. MR2424828. doi. pdf. |

2008 | 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. doi. pdf. |

2007 | Michael Ferrara, Ronald Gould, and Stephen G. Hartke, The structure of 2-factors in iterated line graphs, Discuss. Math. Graph Theory, 27, no. 3, 507–526. MR2412361. doi. pdf. |

2007 | Stephen G. Hartke, Jennifer Vandenbussche, and Paul Wenger, Further results on bar k-visibility Graphs, SIAM J. of Discrete Math., 21, no. 2, 523–531.
MR2318682. doi. pdf. |

2007 | Mike Develin and Stephen G. Hartke, Fire containment in grids of dimension three and higher, Discrete Applied Math., 155, no. 17, 2257–2268. MR2360655. doi. pdf. |

2006 | 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, 179–185. MR2241660. web. pdf. |

2006 | Stephen G. Hartke, The elimination procedure for the competition number is not optimal, Discrete Applied Math., 154, no. 11, 1633–1639. MR2229436. doi. pdf. |

2006 | Stephen G. Hartke, A survey of free math fonts for TeX and LaTeX, The PracTeX Journal, no. 1. webpage. pdf. |

2005 | Stephen Hartke, The elimination procedure for the phylogeny number, Ars Combinatoria, 75, 297–311. MR2133230. pdf. |

2004 | 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, 129–140. MR2075862. pdf. |

2003 | Mike Develin, Stephen Hartke, and David Petrie Moulton, A general notion of visibility graphs, Discrete and Comput. Geom., 29, no. 4, 511–524. MR1976604. doi. pdf. |

2003 | Stephen G. Hartke and Aparna W. Higgins, Minimum degree growth of the iterated line graph, Ars Combinatoria, 69, 275–283. MR2007659. pdf. |

2002 | 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. web. pdf. |

2000 | Stephen G. Hartke, Binary De Bruijn cycles under different equivalence relations, Discrete Math., 215 (2000), 93–102. MR1746451. doi. pdf. |

1999 | Stephen G. Hartke and Aparna W. Higgins, Maximum degree growth of the iterated line graph, Electron. J. Combin., 6, R28. MR1696913. web. pdf. |

Non-Peer-Reviewed Publications

2009 | Stephen G. Hartke and A. J. Radcliffe, Solution to problem #11336 proposed by Donald Knuth, listed as alternate solution, Amer. Math. Monthly, 116, no. 9, 848–849. |

2007 | 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, 285–287. Invited submission. webpage. pdf. |

2006 | Stephen G. Hartke, Eine Übersicht freier Mathematikfonts für TeX und LaTeX, translated by Martin Sievers, Die TeXnische Komödie, 4, 17–36. webpage. |

2003 | Stephen G. Hartke, The voter model with confidence levels, DIMACS Technical Report 2003-45, 16pp. web. pdf. |

2000 | Stephen G. Hartke, Summer mathematics research experiences, Proc. of the Conf. on Summer Undergrad. Math. Research Programs, J.A. Gallian, ed., Amer. Math. Society, 267–271. Invited submission. webpage. pdf. |

Accepted Papers

2016 | James M. Carraher and Stephen G. Hartke, Eulerian circuits with no monochromatic transitions in edge-colored digraphs with all vertices of outdegree three, accepted to SIAM J. Discrete Math. Refereed, 28pp. pdf. |

Submitted Papers

2016 | Stephen G. Hartke, Sogol Jahanbekam, and Brent Thomas, The chromatic number of the square of subcubic planar graphs, submitted to J. Combin. Theory B. To be refereed, 19pp. pdf. arXiv:1604.06504. |

2015 | Péter L. Erdős, Stephen G. Hartke, Leo van Iersel, and István Miklós, Graph realizations constrained by skeleton graphs, submitted to Elec. J. of Combin. To be refereed, 20pp. arXiv:1508.00542. |

2015 | On the Strong Chromatic Index of Sparse Graphs, Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Sogol Jahanbekam, Bernard Lidický, Luke Nelsen, Derrick Stolee, and Eric Sullivan, On the strong chromatic index of sparse graphs, submitted to J. Graph Theory. To be refereed, 15pp. arXiv:1508.03515. |

2014 | Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger, Extending Precolorings to Distinguish Group Actions, submitted to Euro. J. Combin. To be refereed, 21pp. arXiv:1405.5558. |

2013 | Stephen G. Hartke, Hong Liu, and Šárka Petříčková, Coloring fractional powers of graphs, submitted to J. Graph Theory. To be refereed, 15pp. pdf. |

Back | This page last modified . |