Faisal N. Abu-Khzam

activity

20132026

most citedA Hybrid Graph Representation for Exact Graph Algorithms

4 citations · 16 across the 22 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2018

Partitioning a graph into degenerate subgraphs

Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes

Let $G = (V, E)$ be a connected graph with maximum degree $k \geq 3$ distinct from $K_{k + 1}$ . Given integers $s \geq 2$ and $p_{1}, \dots, p_{s} \geq 0$ , $G$ is said to be $(p_1, \dots, p…

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…