research
∙
04/06/2023
The complexity of decomposing a graph into a matching and a bounded linear forest
Deciding whether a graph can be edge-decomposed into a matching and a k-...
share
research
∙
02/25/2022
A note on Cops and Robbers, independence number, domination number and diameter
We study relations between diameter D(G), domination number γ(G), indepe...
research
∙
12/14/2021
