19 citations · 75 across the 31 of their papers we have counts for
39 papers
Determining Factorial Speed Fast
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The speed of a graph class measures how many labeled graphs on vertices one can find in . This graph class complexity function is explicitly provided on graphc…
Hitting the Romans
Henning Fernau, Kevin Mann
Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, a…
Sum Labelling Graphs of Maximum Degree Two
Henning Fernau, Kshitij Gajjar
The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices…
Parameterizing Path Partitions
Henning Fernau, Florent Foucaud, Kevin Mann +2
We study the algorithmic complexity of partitioning the vertex set of a given (di)graph into a small number of paths. The Path Partition problem (PP) has been studied extensively,…
Recognizing well-dominated graphs is coNP-complete
Akanksha Agrawal, Henning Fernau, Philipp Kindermann +2
A graph is well-covered if every minimal vertex cover of is minimum, and a graph is well-dominated if every minimal dominating set of is minimum. Studies on well-co…
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
The concept of Roman domination has recently been studied concerning enumerating and counting (WG 2022). It has been shown that minimal Roman dominating functions can be enumerated…