3 papers
math.CO2025
Majority additive coloring and the maximum degree
Christoph Brause, Dieter Rautenbach, Laurin Schwartze
Kamyczura introduced the notion of a majority additive -coloring of a graph as a function such that $$\left|\left\{u \in N_G(v):\sum_{w \in N_…
math.CO2025
On the distinguishing chromatic number in hereditary graph classes
Christoph Brause, RafaÅ Kalinowski, Monika PilÅniak +1
The distinguishing chromatic number of a graph , denoted , is the minimum number of colours in a proper vertex colouring of that is preserved by the identity automo…
math.CO2024
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
Christoph Brause, Jochen Harant, Florian Hörsch +1
Given a graph and sets and of non-negative integers, it is known that the decision problem whether contains a spanning tree…