J. Harant

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Lower bounds on the independence number of a graph in terms of degrees

Jochen Harant, Ingo Schiermeyer

Given an integer $I^ \geq 3$ , let $G_{I^}$ be the set of connected graphs $G \neq = K_{I^ + 1}$ with maximum degree $I^$ and, for $i = 1, \dots, I^$ , let $V_{i} (G)$ be the set of verti…

math.CO2025

On the independence number in subcubic graphs

Jochen Harant, Ingo Schiermeyer

For a connected subcubic graph $G \neq = K_{1}$ let $V_{i} (G) = {v \in V (G) ∣ d_{G} (v) = i}$ for $1 \leq i \leq 3.$ Given $c_{1}, c_{2}, c_{3} \in R^{+}$ and $d \in R$ , we sho…

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 $G$ and sets ${I^\pm_{v} ∣ v \in V (G)}$ and ${I^_{v}^{2} ∣ v \in V (G)}$ of non-negative integers, it is known that the decision problem whether $G$ contains a spanning tree…