APA (7th ed.) Citation

Abu-Khzam, F. N., Feghali, C., & Muller, H. (2014). NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph.

Chicago Style (17th ed.) Citation

Abu-Khzam, Faisal N., Carl Feghali, and Haiko Muller. NP-hardness Results for Partitioning Graphs into Disjoint Cliques and a Triangle-free Subgraph. 2014.

MLA (9th ed.) Citation

Abu-Khzam, Faisal N., et al. NP-hardness Results for Partitioning Graphs into Disjoint Cliques and a Triangle-free Subgraph. 2014.