19 citations · 75 across the 31 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023★ 3 cited
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…
math.CO2023
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…