Thomas Schweser

activity

20152020

collaborators

10 papers

math.CO2020

Digraphs and variable degeneracy

Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz

Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f : V (D) \to N_{0}^{p}$ be a vector function with $f = (f_{1}, f_{2}, \dots, f_{p})$ . We say that $D$ has an $f$ -partition if…

math.CO2020

Point partition numbers: perfect graphs

Justus von Postel, Thomas Schweser, Michael Stiebitz

Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer $t \geq 1$ , denote by $M G_{t}$ the class of graphs whose ma…

math.CO2019

Hajós and Ore constructions for digraphs

Jørgen Bang-Jensen, Thomas Bellitto, Michael Stiebitz +1

The chromatic number $χ (D)$ of a digraph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class induces an acyclic subdig…

math.CO2018

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…

cond-mat.dis-nn2018

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…

math.CO2018

Vertex partition of hypergraphs and maximum degenerate subhypergraphs

Thomas Schweser, Michael Stiebitz

In 2007 Matamala proved that if $G$ is a simple graph with maximum degree $Δ \geq 3$ not containing $K_{Δ + 1}$ as a subgraph and $s, t$ are positive integers such that $s + t \geq Δ$ ,…