Path coloring problems in graphs are non-approximable

Conference Paper uoadl:1043085 617 Read counter

Original Title:
Path coloring problems in graphs are non-approximable
Languages of Item:
English
Creator:
Nomikos, Christos
Abstract:
Empty abstract
Main subject category:
Computer Graphics
Pages (from-to):
223-230
The digital material of the item is not available.