
There is a more recent version of this eprint available. Click here to view it.
Chudnovsky, M, Lo, I, Maffray, F et al. (2 more authors) (Accepted: 2015) Coloring Square-free Berge Graphs. arXiv. (Unpublished)
Abstract
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. 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: | © 2015 The Author(s). Imported from arXiv |
Keywords: | math.CO; 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) > Institute for Computational and Systems Science (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/K016423/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 27 Nov 2015 12:49 |
Last Modified: | 25 Feb 2019 11:15 |
Published Version: | http://arxiv.org/pdf/1509.09195v1.pdf |
Status: | Unpublished |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:92290 |
Available Versions of this Item
- Coloring Square-free Berge Graphs. (deposited 27 Nov 2015 12:49) [Currently Displayed]