Stephen Hartke
Stephen Hartke
Verified email at - Homepage
Cited by
Cited by
Fire containment in grids of dimension three and higher
M Develin, SG Hartke
Discrete Applied Mathematics 155 (17), 2257-2268, 2007
Mckay’s canonical graph labeling algorithm
SG Hartke, AJ Radcliffe
Communicating mathematics 479, 99-111, 2009
The chromatic number of the square of subcubic planar graphs
SG Hartke, S Jahanbekam, B Thomas
arXiv preprint arXiv:1604.06504, 2016
New results on degree sequences of uniform hypergraphs
S Behrens, C Erbes, M Ferrara, SG Hartke, B Reiniger, H Spinoza, ...
the electronic journal of combinatorics, P14-P14, 2013
Edge-disjoint rainbow spanning trees in complete graphs
JM Carraher, SG Hartke, P Horn
European Journal of Combinatorics 57, 71-84, 2016
Packing of graphic n‐tuples
AH Busch, MJ Ferrara, SG Hartke, MS Jacobson, H Kaul, DB West
Journal of Graph Theory 70 (1), 29-39, 2012
The hub number of a graph
T Grauman, SG Hartke, A Jobson, B Kinnersley, DB West, L Wiglesworth, ...
Information processing letters 108 (4), 226-228, 2008
Attempting to narrow the integrality gap for the firefighter problem on trees
SG Hartke
DIMACS series in discrete mathematics and theoretical computer science 70, 225, 2006
Distinguishing chromatic number of Cartesian products of graphs
JO Choi, SG Hartke, H Kaul
SIAM Journal on Discrete Mathematics 24 (1), 82-100, 2010
On the first-fit chromatic number of graphs
J Balogh, SG Hartke, Q Liu, G Yu
SIAM Journal on Discrete Mathematics 22 (3), 887-900, 2008
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
MD Barrus, SG Hartke, KF Jao, DB West
Discrete Mathematics 312 (9), 1494-1501, 2012
Graph classes characterized both by forbidden subgraphs and degree sequences
MD Barrus, M Kumbhat, SG Hartke
Journal of Graph Theory 57 (2), 131-148, 2008
Circular -coloring of sparse graphs
OV Borodin, SG Hartke, AO Ivanova, AV Kostochka, DB West
Сибирские электронные математические известия 5 (0), 417-426, 2008
On the hardness of recognizing triangular line graphs
P Anand, H Escuadro, R Gera, SG Hartke, D Stolee
Discrete Mathematics 312 (17), 2627-2638, 2012
Further results on bar k-visibility graphs
SG Hartke, J Vandenbussche, P Wenger
SIAM Journal on Discrete Mathematics 21 (2), 523-531, 2007
Graph realizations constrained by skeleton graphs
PL Erdős, SG Hartke, L van Iersel, I Miklós
arXiv preprint arXiv:1508.00542, 2015
Random partitions and edge-disjoint Hamiltonian cycles
SG Hartke, T Seacrest
Journal of Combinatorial Theory, Series B 103 (6), 742-766, 2013
Extremal graphs with a given number of perfect matchings
SG Hartke, D Stolee, DB West, M Yancey
Journal of Graph Theory 73 (4), 449-468, 2013
Graph-theoretic models of spread and competition
SG Hartke
Rutgers University, 2004
An algorithm for generating all connected subgraphs with k vertices of a graph
S Karakashian, BY Choueiry, SG Hartke
Lincoln, NE 10 (2505515.2505560), 2013
The system can't perform the operation now. Try again later.
Articles 1–20