Coloring square-free Berge graphs

This is the latest version of this eprint.

Chudnovsky, M, Lo, I, Maffray, F et al. (2 more authors) (2019) Coloring square-free Berge graphs. Journal of Combinatorial Theory, Series B, 135. pp. 96-128. ISSN 0095-8956

Abstract

Metadata

Authors/Creators:
  • Chudnovsky, M
  • Lo, I
  • Maffray, F
  • Trotignon, N
  • Vušković, K
Copyright, Publisher and Additional Information: © 2018 Elsevier Inc. 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: Berge graph; Square-free; Coloring; Algorithm
Dates:
  • Accepted: 31 July 2018
  • Published (online): 5 September 2018
  • Published: March 2019
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRCEP/K016423/1
Depositing User: Symplectic Publications
Date Deposited: 07 Sep 2018 12:26
Last Modified: 05 Sep 2019 00:42
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.jctb.2018.07.010

Available Versions of this Item

Download

Export

Statistics


CORE (COnnecting REpositories)