Coloring perfect graphs with no balanced skew-partitions

Chudnovsky, M, Trotignon, N, Trunck, T et al. (1 more author) (2015) Coloring perfect graphs with no balanced skew-partitions. Journal of Combinatorial Theory, Series B, 115. pp. 26-65. ISSN 0095-8956

Abstract

Metadata

Authors/Creators:
  • Chudnovsky, M
  • Trotignon, N
  • Trunck, T
  • Vuskovic, K
Copyright, Publisher and Additional Information: © 2015, Elsevier. This is an author produced version of a paper published in Journal of Combinatorial Theory, Series B. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Perfect graphs; berge graphs; coloring; maximum stable set; 2-join; skew partition; homogeneous pair
Dates:
  • Accepted: 10 April 2015
  • Published (online): 29 April 2015
  • Published: November 2015
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 24 Apr 2015 11:24
Last Modified: 14 May 2019 15:52
Published Version: http://dx.doi.org/10.1016/j.jctb.2015.04.007
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.jctb.2015.04.007
Related URLs:

Export

Statistics


CORE (COnnecting REpositories)