J. Harant

activity

20172025

most citedLong Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs

10 citations · 19 across the 8 of their papers we have counts for

collaborators

Showing 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

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

Jochen Harant, Ingo Schiermeyer

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

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…