Partitioning a graph into disjoint cliques and a triangle-free graph

Abu-Khzam, FN, Feghali, C and Muller, H (2015) Partitioning a graph into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, 190-19. 1 - 12. ISSN 0166-218X

Abstract

Metadata

Authors/Creators:
  • Abu-Khzam, FN
  • Feghali, C
  • Muller, H
Copyright, Publisher and Additional Information: © 2015 Elsevier B.V. All rights reserved. This is an author produced version of a paper published in Discrete Applied Mathematics. Uploaded in accordance with the publisher's self-archiving policy
Keywords: computational complexity; graph partitioning; special graph class
Dates:
  • Published: 20 August 2015
  • Accepted: 26 March 2015
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 19 Aug 2015 15:56
Last Modified: 28 Apr 2016 16:56
Published Version: http://dx.doi.org/10.1016/j.dam.2015.03.015
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.dam.2015.03.015

Share / Export

Statistics