default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen G. Hartke
Person information
- affiliation: University of Colorado Denver, Department of Mathematical and Statistical Sciences
- affiliation: University of Nebraska-Lincoln, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j41]Eric Culver
, Stephen G. Hartke:
Relation between the correspondence chromatic number and the Alon-Tarsi number. Discret. Math. 346(6): 113347 (2023)- 2022
- [j40]Philip DeOrsey, Stephen G. Hartke, Jason Williford:
A Classification of Hyperfocused 12-Arcs. Graphs Comb. 38(5): 151 (2022) - 2019
- [j39]Péter L. Erdös, Michael Ferrara, Stephen G. Hartke:
Navigating between packings of graphic sequences. Discret. Appl. Math. 266: 252-258 (2019) - 2018
- [j38]Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White:
On the Strong Chromatic Index of Sparse Graphs. Electron. J. Comb. 25(3): 3 (2018) - [j37]András Gyárfás, Stephen G. Hartke, Charles Viss:
Uniquely Kr(k)-Saturated Hypergraphs. Electron. J. Comb. 25(4): 4 (2018) - [j36]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
Extending precolorings to distinguish group actions. Eur. J. Comb. 72: 12-28 (2018) - 2017
- [j35]Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós:
Graph Realizations Constrained by Skeleton Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j34]James M. Carraher, Stephen G. Hartke:
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three. SIAM J. Discret. Math. 31(1): 190-209 (2017) - 2016
- [j33]James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee:
On the independence ratio of distance graphs. Discret. Math. 339(12): 3058-3072 (2016) - [j32]James M. Carraher, Stephen G. Hartke, Paul Horn:
Edge-disjoint rainbow spanning trees in complete graphs. Eur. J. Comb. 57: 71-84 (2016) - 2015
- [j31]Michael D. Barrus, Stephen G. Hartke:
Minimal forbidden sets for degree sequence characterizations. Discret. Math. 338(9): 1543-1554 (2015) - [j30]Michael D. Barrus, Stephen G. Hartke, Mohit Kumbhat:
Non-minimal Degree-Sequence-Forcing Triples. Graphs Comb. 31(5): 1189-1209 (2015) - 2014
- [j29]Stephen G. Hartke, Derrick Stolee:
A linear programming approach to the Manickam-Miklós-Singhi conjecture. Eur. J. Comb. 36: 53-70 (2014) - [j28]Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson:
A Degree Sequence Variant of Graph Ramsey Numbers. Graphs Comb. 30(4): 847-859 (2014) - 2013
- [j27]Sarah Behrens, Catherine Erbes, Michael Ferrara, Stephen G. Hartke, Benjamin Reiniger, Hannah Spinoza, Charles Tomlinson:
New Results on Degree Sequences of Uniform Hypergraphs. Electron. J. Comb. 20(4): 14 (2013) - [j26]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
List distinguishing parameters of trees. Discret. Appl. Math. 161(6): 864-869 (2013) - [j25]Stephen G. Hartke, Tyler Seacrest:
Random partitions and edge-disjoint Hamiltonian cycles. J. Comb. Theory B 103(6): 742-766 (2013) - [j24]Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey:
Extremal Graphs With a Given Number of Perfect Matchings. J. Graph Theory 73(4): 449-468 (2013) - [j23]James M. Carraher, Stephen G. Hartke:
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs. SIAM J. Discret. Math. 27(4): 1924-1939 (2013) - 2012
- [j22]Stephen G. Hartke, Derrick Stolee:
Uniquely Kr-Saturated Graphs. Electron. J. Comb. 19(4): 6 (2012) - [j21]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. Discret. Math. 312(9): 1494-1501 (2012) - [j20]Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee:
On the hardness of recognizing triangular line graphs. Discret. Math. 312(17): 2627-2638 (2012) - [j19]Stephen G. Hartke, Geir T. Helleloid:
Reconstructing a Graph from its Arc Incidence Graph. Graphs Comb. 28(5): 637-652 (2012) - [j18]Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West:
Packing of graphic n-tuples. J. Graph Theory 70(1): 29-39 (2012) - [j17]Stephen G. Hartke, Tyler Seacrest:
Graphic Sequences Have Realizations Containing Bisections of Large Degree. J. Graph Theory 71(4): 386-401 (2012) - 2010
- [j16]Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee:
Automorphism Groups of a Graph and a Vertex-Deleted Subgraph. Electron. J. Comb. 17(1) (2010) - [j15]Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul:
Distinguishing Chromatic Number of Cartesian Products of Graphs. SIAM J. Discret. Math. 24(1): 82-100 (2010) - 2009
- [j14]Kyung-Won Hwang, Naeem N. Sheikh, Stephen G. Hartke:
A Note on Divisibility of the Number of Matchings of a Family of Graphs. Electron. J. Comb. 16(1) (2009) - [j13]Stephen G. Hartke, Kathleen Ponto:
k-ordered hamiltonicity of iterated line graphs. Discret. Math. 309(6): 1491-1497 (2009) - 2008
- [j12]Tracy Grauman, Stephen G. Hartke, Adam S. Jobson, William B. Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu:
The hub number of a graph. Inf. Process. Lett. 108(4): 226-228 (2008) - [j11]Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartke:
Graph classes characterized both by forbidden subgraphs and degree sequences. J. Graph Theory 57(2): 131-148 (2008) - [j10]József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu:
On the First-Fit Chromatic Number of Graphs. SIAM J. Discret. Math. 22(3): 887-900 (2008) - 2007
- [j9]Mike Develin, Stephen G. Hartke:
Fire containment in grids of dimension three and higher. Discret. Appl. Math. 155(17): 2257-2268 (2007) - [j8]Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs. Discuss. Math. Graph Theory 27(3): 507-526 (2007) - [j7]Stephen G. Hartke, Jennifer Vandenbussche, Paul S. Wenger:
Further Results on Bar k-Visibility Graphs. SIAM J. Discret. Math. 21(2): 523-531 (2007) - 2006
- [j6]Stephen G. Hartke:
The elimination procedure for the competition number is not optimal. Discret. Appl. Math. 154(11): 1633-1639 (2006) - 2005
- [j5]Stephen G. Hartke:
The Elimination Procedure for the Phylogeny Number. Ars Comb. 75 (2005) - 2003
- [j4]Stephen G. Hartke, Aparna W. Higgins:
Minimum Degree Growth of the Iterated Line Graph. Ars Comb. 69 (2003) - [j3]Mike Develin, Stephen G. Hartke, David Petrie Moulton:
A General Notion of Visibility Graphs. Discret. Comput. Geom. 29(4): 511-524 (2003) - 2000
- [j2]Stephen G. Hartke:
Binary De Bruijn cycles under different equivalence relations. Discret. Math. 215: 93-102 (2000) - 1999
- [j1]Stephen G. Hartke, Aparna W. Higgins:
Maximum Degree Growth of the Iterated Line Graph. Electron. J. Comb. 6 (1999)
Conference and Workshop Papers
- 2004
- [c1]Stephen G. Hartke:
Attempting to Narrow the Integrality Gap for the Firefighter Problem on Trees. Discrete Methods in Epidemiology 2004: 225-231
Informal and Other Publications
- 2024
- [i3]Calum Buchanan, MacKenzie Carr, Alexander Clifton, Stephen G. Hartke, Vesna Irsic, Nicholas Sieger, Rebecca Whitman:
Trail Trap: a variant of Partizan Edge Geography. CoRR abs/2405.05195 (2024) - 2013
- [i2]Stephen G. Hartke, Derrick Stolee:
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture. CoRR abs/1302.3636 (2013) - 2012
- [i1]Stephen G. Hartke, Derrick Stolee:
Uniquely K_r-Saturated Graphs. CoRR abs/1203.1084 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
