Stephen G. Hartke

From MaRDI portal
Person:298337

Available identifiers

zbMath Open hartke.stephen-gWikidataQ102271105 ScholiaQ102271105MaRDI QIDQ298337

List of research outcomes

PublicationDate of PublicationType
Domination of subcubic planar graphs with large girth2023-12-06Paper
Relation between the correspondence chromatic number and the Alon-Tarsi number2023-04-20Paper
Square of Planar Graphs of Max Degree Four without Five Cycles2022-10-24Paper
A classification of hyperfocused 12-arcs2022-09-12Paper
Relation between the correspondence chromatic number and the Alon--Tarsi number2022-06-23Paper
Navigating between packings of graphic sequences2021-05-19Paper
Uniquely \(K_r^{(k)}\)-saturated hypergraphs2018-11-22Paper
On the strong chromatic index of sparse graphs2018-08-15Paper
Extending precolorings to distinguish group actions2018-06-28Paper
Graph realizations constrained by skeleton graphs2017-07-13Paper
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three2017-02-09Paper
On the independence ratio of distance graphs2016-08-16Paper
Edge-disjoint rainbow spanning trees in complete graphs2016-06-20Paper
The chromatic number of the square of subcubic planar graphs2016-04-21Paper
Non-minimal degree-sequence-forcing triples2015-09-24Paper
Minimal forbidden sets for degree sequence characterizations2015-05-18Paper
A degree sequence variant of graph Ramsey numbers2014-09-19Paper
The alpha problem \& line count configurations2014-08-28Paper
New results on degree sequences of uniform hypergraphs2014-08-14Paper
Circular \((5,2)\)-coloring of sparse graphs2014-06-13Paper
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs2014-04-10Paper
A linear programming approach to the Manickam-Miklós-Singhi conjecture2014-03-25Paper
Extremal Graphs With a Given Number of Perfect Matchings2013-07-31Paper
Uniquely \(K_r\)-saturated graphs2013-06-07Paper
Signatures of strings2013-05-13Paper
List distinguishing parameters of trees2013-04-18Paper
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture2013-02-14Paper
Reconstructing a graph from its arc incidence graph2012-12-27Paper
On coloring of fractional powers of graphs2012-12-17Paper
Graphic Sequences Have Realizations Containing Bisections of Large Degree2012-11-23Paper
Packing of graphic n-tuples2012-06-04Paper
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps2012-04-30Paper
Distinguishing Chromatic Number of Cartesian Products of Graphs2011-03-15Paper
Automorphism groups of a graph and a vertex-deleted subgraph2010-10-13Paper
The nonexistence of a (K6-e)-decomposition of the complete graphK292010-08-03Paper
The hub number of a graph2010-06-09Paper
On the First-Fit Chromatic Number of Graphs2009-08-20Paper
A note on divisibility of the number of matchings of a family of graphs2009-07-08Paper
\(k\)-ordered hamiltonicity of iterated line graphs2009-06-17Paper
https://portal.mardi4nfdi.de/entity/Q36208182009-04-14Paper
The structure and existence of 2-factors in iterated line graphs2008-06-18Paper
On a question of Sós about 3-uniform friendship hypergraphs2008-06-05Paper
Further Results on Bar k-Visibility Graphs2008-05-22Paper
Graph classes characterized both by forbidden subgraphs and degree sequences2008-02-13Paper
Fire containment in grids of dimension three and higher2007-10-29Paper
The elimination procedure for the competition number is not optimal2006-08-14Paper
https://portal.mardi4nfdi.de/entity/Q54660402005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54635722005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q48208332004-10-01Paper
A general notion of visibility graphs2003-08-21Paper
Binary de Bruijn cycles under different equivalence relations2000-07-27Paper
Maximum degree growth of the iterated line graph1999-07-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stephen G. Hartke