1 citations · 1 across the 7 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Point partition numbers: decomposable and indecomposable critical graphs
Justus von Postel, Thomas Schweser, Michael Stiebitz
Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number is the least integer for which admits…
math.CO2019
Hajós and Ore constructions for digraphs
Jørgen Bang-Jensen, Thomas Bellitto, Michael Stiebitz +1
The chromatic number of a digraph is the minimum number of colors needed to color the vertices of such that each color class induces an acyclic subdig…
math.CO2019
Generalized DP-Colorings of Graphs
Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz
By a graph we mean a finite undirected graph having multiple edges but no loops. Given a graph property , a -coloring of a graph with color set is…