5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DM2017
Cograph Editing: Merging Modules is equivalent to Editing P4's
Marc Hellmuth, Adrian Fritz, Nicolas Wieseke +1
The modular decomposition of a graph does not contain prime modules if and only if is a cograph, that is, if no quadruple of vertices induces a simple connected path…
cs.CC2012★ 5 cited
On the Complexity of Recognizing S-composite and S-prime Graphs
Marc Hellmuth
S-prime graphs are graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs, i.e., whenever it is a subgraph of a nontrivial Cartesian p…