166 citations · 167 across the 5 of their papers we have counts for
6 papers · 1 filter
On DP-Coloring of Digraphs
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser +1
DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of find…
Machine Learning in Electronic Quantum Matter Imaging Experiments
Yi Zhang, A. Mesaros, K. Fujita +8
Essentials of the scientific discovery process have remained largely unchanged for centuries: systematic human observation of natural phenomena is used to form hypotheses that, whe…
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Thomas Schweser, Michael Stiebitz
In 2007 Matamala proved that if is a simple graph with maximum degree not containing as a subgraph and are positive integers such that ,…
Coloring hypergraphs of low connectivity
Thomas Schweser, Michael Stiebitz, Bjarne Toft
For a hypergraph , let and denote the chromatic number, the maximum degree, and the maximum local edge connectivity of , respectively. A result of Rhys P…
Partitions of hypergraphs under variable degeneracy constraints
Thomas Schweser, Michael Stiebitz
The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given…
Generalized Hypergraph Coloring
Thomas Schweser
A smooth hypergraph property is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hyper…