M. Stiebitz

activity

20092025

most citedPartitions of multigraphs under degree constraints

1 citations · 1 across the 7 of their papers we have counts for

collaborators

16 papers

math.CO2025

The Tournament Theorem of Rédei revisited

Thomas Schweser, Michael Stiebitz, Bjarne Toft

In 1934 L. Rédei published his famous theorem that the number of Hamiltonian paths in a tournament is odd. In fact it is a corollary of a stronger theorem in his paper. Stronger th…

math.CO2025

Generalized DP-colorings of digraphs

Lucas Picasarri-Arrieta, Michael Stiebitz

In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce…

math.CO2023

Minimum number of arcs in $k$ -critical digraphs with order at most $2 k - 1$

Lucas Picasarri-Arrieta, Michael Stiebitz

The dichromatic number $χ (D)$ of a digraph $D$ is the least integer $k$ for which $D$ has a coloring with $k$ colors such that there is no monochromatic directed cycle in $D$ .…

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

Point partition numbers: decomposable and indecomposable critical graphs