The complexity of coloring graphs without long induced paths

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Acta Cybernetica

The complexity of coloring graphs without long induced paths

Gerhard J. Woeginger, Jiri Sgall

Journal Title: Acta Cybernetica

Date: 2001

Volume: 15

Issue: 1

p. 107

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.math.cas.cz/~sgall/ps/pkfree.ps

For further information about this item go to:

http://www.inf.u-szeged.hu/kutatas/actacybernetica/vol15n1/cikk8.xml

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12