Clique cutsets beyond chordal graphs

Boncompagni, V, Penev, I and Vuskovic, K (2017) Clique cutsets beyond chordal graphs. In: Electronic Notes in Discrete Mathematics. IX Latin and American Algorithms, Graphs and Optimization Sympoisium, 11-15 Sep 2017, Marseille, France. Elsevier , pp. 81-86.

Abstract

Metadata

Authors/Creators:
  • Boncompagni, V
  • Penev, I
  • Vuskovic, K
Copyright, Publisher and Additional Information: © 2017 Published by Elsevier B.V. This is an author produced version of a paper published in Electronic Notes in Discrete Mathematics. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: clique; stable set; vertex coloring; structure; algorithms
Dates:
  • Published: November 2017
  • Accepted: 21 June 2017
  • Published (online): 26 October 2017
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRCEP/K016423/1
EPSRCEP/N019660/1
Depositing User: Symplectic Publications
Date Deposited: 17 Jul 2017 11:11
Last Modified: 26 Oct 2018 00:49
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.endm.2017.10.015

Share / Export

Statistics