Stefanie Gerke

From MaRDI portal
Person:501983

Available identifiers

zbMath Open gerke.stefanieMaRDI QIDQ501983

List of research outcomes

PublicationDate of PublicationType
On Seymour's and Sullivan's second neighbourhood conjectures2024-01-30Paper
Kings in multipartite hypertournaments2023-10-04Paper
Results on the small quasi-kernel conjecture2023-05-15Paper
Bounds on Maximum Weight Directed Cut2023-04-20Paper
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs2023-01-04Paper
Extended path partition conjecture for semicomplete and acyclic compositions2022-08-24Paper
Proper orientation number of triangle‐free bridgeless outerplanar graphs2022-03-31Paper
Proximity and remoteness in directed and undirected graphs2021-01-27Paper
Successive shortest paths in complete graphs with random edge weights2021-01-05Paper
The asymptotic number of prefix normal words2019-08-13Paper
Maximizing the Minimum Load for Random Processing Times2018-10-30Paper
Adversarial resilience of matchings in bipartite random graphs2017-01-10Paper
Controllability and matchings in random bipartite graphs2016-12-20Paper
Nonvertex‐Balanced Factors in Random Graphs2015-03-24Paper
https://portal.mardi4nfdi.de/entity/Q29217702014-10-13Paper
No dense subgraphs appear in the triangle-free graph process2011-10-18Paper
https://portal.mardi4nfdi.de/entity/Q30123972011-07-06Paper
Pegging Graphs Yields a Small Diameter2011-03-07Paper
https://portal.mardi4nfdi.de/entity/Q35767102010-07-30Paper
Connectivity of the uniform random intersection graph2009-12-15Paper
Algorithms for generating convex sets in acyclic digraphs2009-12-10Paper
Sequences with Changing Dependencies2009-08-20Paper
Convex sets in acyclic digraphs2009-05-04Paper
The number of graphs not containing \(K_{3,3}\) as a minor2009-04-07Paper
Connectivity of addable graph classes2008-04-28Paper
The random planar graph process2008-03-28Paper
A probabilistic counting lemma for complete graphs2008-01-08Paper
The generalized Randić index of trees2008-01-04Paper
\(K_4\)-free subgraphs of random graphs revisited2007-11-12Paper
https://portal.mardi4nfdi.de/entity/Q34472812007-06-28Paper
Generalised acyclic edge colourings of graphs with large girth2007-05-11Paper
A characterization for sparse \(\varepsilon\)-regular pairs2007-03-12Paper
The generalized acyclic edge chromatic number of random regular graphs2007-02-07Paper
https://portal.mardi4nfdi.de/entity/Q34162502007-01-19Paper
Small subsets inherit sparse \(\varepsilon\)-regularity2007-01-11Paper
Graph Imperfection with a Co-Site Constraint2005-02-28Paper
On the Number of Edges in Random Planar Graphs2004-09-24Paper
K5‐free subgraphs of random graphs2004-03-29Paper
Graph imperfection. II2002-12-11Paper
Graph imperfection. I2002-12-10Paper
Channel assignment with large demands2002-06-09Paper
Colouring weighted bipartite graphs with a co-site constraint2001-04-18Paper

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: Stefanie Gerke