Search
Abstract
In the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
INFORMATION PROCESSING LETTERS
no. 116,
edition 1,
pages 26 - 32,
ISSN: 0020-0190 - Language:
- English
- Publication year:
- 2016
- Bibliographic description:
- Janczewski R., Turowski K.: On the hardness of computing span of subcubic graphs// INFORMATION PROCESSING LETTERS. -Vol. 116, iss. 1 (2016), s.26-32
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.ipl.2015.08.009
- Verified by:
- Gdańsk University of Technology
seen 67 times