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
We consider the class of Berge graphs that do not contain an induced cycle of length four. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
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: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/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: | 10.1016/j.jctb.2018.07.010 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:135398 |
Available Versions of this Item
-
Coloring Square-free Berge Graphs. (deposited 27 Nov 2015 12:49)
- Coloring square-free Berge graphs. (deposited 07 Sep 2018 12:26) [Currently Displayed]