activity
20212026
most citedTight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2026

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs

Daniel Neuen, Tim Seppelt

Lovász (1967) showed that two graphs and are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., and admit the same number of…

math.CO2023

Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width

Daniel Neuen

Two graphs are homomorphism indistinguishable over a graph class , denoted by , if for al…