Hartke, Stephen - Department of Mathematics, University of Nebraska Lincoln

• The Elimination Procedures for the Competition Number and the Phylogeny Number
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• Graph Classes Characterized Both by
• Extremal graphs with a given number of perfect Stephen G. Hartke
• Discrete Mathematics 309 (2009) 14911497 www.elsevier.com/locate/disc
• Response Strategies in Deterministic Models of Spread: Vaccination and Firefighting
• Information Processing Letters 108 (2008) 226228 Contents lists available at ScienceDirect
• Automorphism groups of a graph and a vertex-deleted subgraph
• Discrete Applied Mathematics 155 (2007) 22572268 www.elsevier.com/locate/dam
• The Elimination Procedure for the Phylogeny Number
• DIMACS Technical Report 2003-45 December 31, 2003
• Response Strategies in Deterministic Models of Spread: Vaccination and Firefighting
• THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
• Proceedings of the Conference on Summer Undergraduate Mathematics Research Programs
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
• On the hardness of recognizing triangular line graphs Pranav Anand
• Packing of Graphic Sequences Arthur H. Busch
• On a Question of Sos About 3-Uniform Friendship Hypergraphs
• A Note on Divisibility of the Number of Matchings of a Family of Graphs
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
• SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics Vol. 21, No. 2, pp. 523531
• On the degree of local permutation polynomials Wiebke S. Diestelkamp
• DOI: 10.1007/s00454-003-2773-4 Discrete Comput Geom 29:511524 (2003) Discrete & Computational
• Morehead Electronic Journal of Applicable Mathematics Issue 2 --MATH-2001-06
• Discrete Mathematics 215 (2000) 93102 www.elsevier.com/locate/disc
• GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION
• Oral Qualifying Exam Syllabus Stephen Hartke
• Maximum Degree Growth of the Iterated Line Graph
• Non-minimal Degree-Sequence-Forcing Triples Michael D. Barrus
• DIMACS Series in Discrete Mathematics and Theoretical Computer Science
• Reconstructing a graph from its arc incidence graph Stephen G. Hartke
• The Voter Model with Confidence Levels 2.1 Introduction
• The Nonexistence ofa (K6-e)-Decomposition
• Discrete Applied Mathematics 154 (2006) 16331639 www.elsevier.com/locate/dam
• The Voter Model with Confidence Levels 2.1 Introduction
• Contemporary Mathematics McKay's Canonical Graph Labeling Algorithm
• Minimum Degree Growth of the Iterated Line Graph
• Proceedings of the Conference on Summer Undergraduate Mathematics Research Programs
• The Elimination Procedures for the Competition Number and the Phylogeny Number
• GRAPHTHEORETIC MODELS OF SPREAD AND COMPETITION
• Proceedings of the Conference on Summer Undergraduate Mathematics Research Programs
• GRAPHTHEORETIC MODELS OF SPREAD AND COMPETITION
• S e MR ISSN 1813-3304 Siberian Electronic Mathematical Reports
• Graphic Sequences Have Realizations Containing Bisections of Large Degree
• Relating minimum degree and the existence of a k-factor Stephen G. Hartke
• 88 Chapter 4
• Oral Qualifying Exam Syllabus Stephen Hartke
• 12 Chapter 2
• GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION
• Oral Qualifying Exam Syllabus Stephen Hartke
• GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION
• 38 Chapter 3
• GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION
• Extremal graphs with a given number of perfect Stephen G. Hartke
• Uniquely Kr-Saturated Graphs Stephen G. Hartke1,2 Derrick Stolee1,2,3
• Random Partitions and Edge-Disjoint Hamiltonian Stephen G. Hartke
• List Distinguishing Parameters of Trees Michael Ferrara1,2