Showing 2026Show all
2 papers · 1 filter
math.CO2026
Bounds for the ratio between the independent domination number and the domination number
Gunnar Brinkmann, Steven Van Overberghe
In this article we present new and improved results for the ratio between the independent domination number and the domination number in graphs with bounded degree. We present a ge…
math.CO2026
Algorithms for the Generation of Snarks
Gunnar Brinkmann, Steven Van Overberghe
The essential requirement for a cubic graph to be called a snark is that it can not be edge-coloured with three colours. To avoid trivial cases, varying restrictions on the connect…