☰

Stephen G. Hartke - Publications

Affiliations: 
Mathematics The University of Nebraska - Lincoln, Lincoln, NE 
Area:
Theoretical Mathematics
Tree Info Similar researchers PubMed Report error

41 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Erdős PL, Ferrara M, Hartke SG. Navigating Between Packings of Graphic Sequences Discrete Applied Mathematics. 266: 252-258. DOI: 10.1016/J.Dam.2018.06.034  0.487
2018 Gyárfás A, Hartke SG, Viss C. Uniquely K r (k) -Saturated Hypergraphs. Electronic Journal of Combinatorics. 25. DOI: 10.37236/7534  0.344
2018 DeOrsey P, Diemunsch J, Ferrara M, Graber N, Hartke SG, Jahanbekam S, Lidicky B, Nelsen LL, Stolee D, Sullivan E. On the Strong Chromatic Index of Sparse Graphs Electronic Journal of Combinatorics. 25: 3-18. DOI: 10.37236/5390  0.822
2018 Ferrara M, Gethner E, Hartke SG, Stolee D, Wenger PS. Extending Precolorings to Distinguish Group Actions European Journal of Combinatorics. 72: 12-28. DOI: 10.1016/J.Ejc.2018.03.008  0.748
2017 Erdős PL, Hartke SG, Iersel Lv, Miklós I. Graph Realizations Constrained by Skeleton Graphs Electronic Journal of Combinatorics. 24: 2-47. DOI: 10.37236/5459  0.507
2017 Carraher JM, Hartke SG. Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three Siam Journal On Discrete Mathematics. 31: 190-209. DOI: 10.1137/140992850  0.526
2016 Carraher JM, Hartke SG, Horn P. Edge-disjoint rainbow spanning trees in complete graphs European Journal of Combinatorics. 57: 71-84. DOI: 10.1016/J.Ejc.2016.04.003  0.803
2016 Carraher JM, Galvin D, Hartke SG, Radcliffe AJ, Stolee D. On the independence ratio of distance graphs Discrete Mathematics. 339: 3058-3072. DOI: 10.1016/J.Disc.2016.05.018  0.81
2015 Barrus MD, Hartke SG. Minimal forbidden sets for degree sequence characterizations Discrete Mathematics. 338: 1543-1554. DOI: 10.1016/J.Disc.2015.02.018  0.565
2015 Barrus MD, Hartke SG, Kumbhat M. Non-minimal Degree-Sequence-Forcing Triples Graphs and Combinatorics. 31: 1189-1209. DOI: 10.1007/S00373-014-1450-0  0.459
2014 Hartke SG, Stolee D. A linear programming approach to the Manickam-Miklós-Singhi conjecture European Journal of Combinatorics. 36: 53-70. DOI: 10.1016/J.Ejc.2013.06.047  0.736
2014 Busch A, Ferrara M, Hartke SG, Jacobson M. A Degree Sequence Variant of Graph Ramsey Numbers Graphs and Combinatorics. 30: 847-859. DOI: 10.1007/S00373-013-1307-Y  0.611
2013 Behrens S, Erbes C, Ferrara M, Hartke SG, Reiniger B, Spinoza H, Tomlinson C. New Results on Degree Sequences of Uniform Hypergraphs Electronic Journal of Combinatorics. 20: 14. DOI: 10.37236/3414  0.372
2013 Carraher JM, Hartke SG. Eulerian circuits with no monochromatic transitions in edge-colored digraphs Siam Journal On Discrete Mathematics. 27: 1924-1939. DOI: 10.1137/120878732  0.788
2013 Hartke SG, Seacrest T. Random partitions and edge-disjoint Hamiltonian cycles Journal of Combinatorial Theory. Series B. 103: 742-766. DOI: 10.1016/J.Jctb.2013.09.004  0.764
2013 Ferrara M, Gethner E, Hartke SG, Stolee D, Wenger PS. List distinguishing parameters of trees Discrete Applied Mathematics. 161: 864-869. DOI: 10.1016/J.Dam.2012.10.003  0.772
2013 Hartke SG, Stolee D, West DB, Yancey M. Extremal graphs with a given number of perfect matchings Journal of Graph Theory. 73: 449-468. DOI: 10.1002/Jgt.21687  0.766
2012 Hartke SG, Stolee D. Uniquely $K_r$-Saturated Graphs Electronic Journal of Combinatorics. 19: 6. DOI: 10.37236/2162  0.802
2012 Anand P, Escuadro H, Gera R, Hartke SG, Stolee D. On the hardness of recognizing triangular line graphs Discrete Mathematics. 312: 2627-2638. DOI: 10.1016/J.Disc.2011.11.037  0.814
2012 Barrus MD, Hartke SG, Jao KF, West DB. Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps Discrete Mathematics. 312: 1494-1501. DOI: 10.1016/J.Disc.2011.05.001  0.391
2012 Hartke SG, Helleloid GT. Reconstructing a Graph from its Arc Incidence Graph Graphs and Combinatorics. 28: 637-652. DOI: 10.1007/S00373-011-1073-7  0.638
2012 Hartke SG, Seacrest T. Graphic sequences have realizations containing bisections of large degree Journal of Graph Theory. 71: 386-401. DOI: 10.1002/Jgt.20652  0.788
2012 Busch AH, Ferrara MJ, Hartke SG, Jacobson MS, Kaul H, West DB. Packing of graphic n-tuples Journal of Graph Theory. 70: 29-39. DOI: 10.1002/Jgt.20598  0.595
2012 Hartke SG, Stolee D. Uniquely K r-saturated graphs Electronic Journal of Combinatorics. 19.  0.798
2010 Hartke SG, Kolb H, Nishikawa J, Stolee D. Automorphism groups of a graph and a vertex-deleted subgraph Electronic Journal of Combinatorics. 17. DOI: 10.37236/406  0.798
2010 Choi JO, Hartke SG, Kaul H. Distinguishing chromatic number of cartesian products of graphs Siam Journal On Discrete Mathematics. 24: 82-100. DOI: 10.1137/060651392  0.629
2010 Hartke SG, Östergård PRJ, Bryant D, El-Zanati SI. The nonexistence of a (K6-e)-decomposition of the complete graph K29 Journal of Combinatorial Designs. 18: 94-104. DOI: 10.1002/Jcd.20226  0.533
2009 Hwang KW, Sheikh NN, Hartke SG. A note on divisibility of the number of matchings of a family of graphs Electronic Journal of Combinatorics. 16. DOI: 10.37236/248  0.622
2009 Hartke SG, Ponto K. k-ordered hamiltonicity of iterated line graphs Discrete Mathematics. 309: 1491-1497. DOI: 10.1016/J.Disc.2008.02.044  0.591
2008 Balogh J, Hartke SG, Liu Q, Yu G. On the first-fit chromatic number of graphs Siam Journal On Discrete Mathematics. 22: 887-900. DOI: 10.1137/060672479  0.658
2008 Grauman T, Hartke SG, Jobson A, Kinnersley B, West DB, Wiglesworth L, Worah P, Wu H. The hub number of a graph Information Processing Letters. 108: 226-228. DOI: 10.1016/J.Ipl.2008.05.022  0.577
2008 Barras MD, Kumbhat M, Hartke SG. Graph classes characterized both by forbidden subgraphs and degree sequences Journal of Graph Theory. 57: 131-148. DOI: 10.1002/jgt.20270  0.529
2008 Hartke SG, Vandenbussche J. On a question of Sós about 3-uniform friendship hypergraphs Journal of Combinatorial Designs. 16: 253-261. DOI: 10.1002/Jcd.20183  0.597
2007 Ferrara MJ, Gould RJ, Hartke SG. The Structure And Existence Of 2-Factors In Iterated Line Graphs Discussiones Mathematicae Graph Theory. 27: 507-526. DOI: 10.7151/Dmgt.1376  0.602
2007 Hartke SG, Vandenbussche J, Wenger P. Further results on bar k-visibility graphs Siam Journal On Discrete Mathematics. 21: 523-531. DOI: 10.1137/050644240  0.651
2007 Develin M, Hartke SG. Fire containment in grids of dimension three and higher Discrete Applied Mathematics. 155: 2257-2268. DOI: 10.1016/J.Dam.2007.06.002  0.405
2006 Hartke SG. The elimination procedure for the competition number is not optimal Discrete Applied Mathematics. 154: 1633-1639. DOI: 10.1016/J.Dam.2005.11.009  0.598
2003 Develin M, Hartke SG, Moulton DP. A General Notion of Visibility Graphs Discrete and Computational Geometry. 29: 511-524. DOI: 10.1007/S00454-003-2773-4  0.574
2003 Hartke SG, Higgins AW. Minimum Degree Growth of the Iterated Line Graph Ars Combinatoria. 69: 275-283.  0.558
2000 Hartke SG. Binary De Bruijn cycles under different equivalence relations Discrete Mathematics. 215: 93-102. DOI: 10.1016/S0012-365X(99)00230-7  0.399
1999 Hartke SG, Higgins AW. Maximum degree growth of the iterated line graph Electronic Journal of Combinatorics. 6. DOI: 10.37236/1460  0.63
Show low-probability matches.