Haiko Müller

activity

20142025

most citedCounting weighted independent sets beyond the permanent

7 citations · 15 across the 8 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014★ 4 cited

NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph

Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller

This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. T…

cs.CC2014

Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph

Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller

A graph $G = (V, E)$ is \emph{partitionable} if there exists a partition ${A, B}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph.…