Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10929Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Asdre, K. | en |
| dc.contributor.author | Ioannidou, K. | en |
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.date.accessioned | 2015-11-24T17:01:28Z | - |
| dc.date.available | 2015-11-24T17:01:28Z | - |
| dc.identifier.issn | 0166-218X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10929 | - |
| dc.rights | Default Licence | - |
| dc.subject | harmonious coloring | en |
| dc.subject | harmonious chromatic number | en |
| dc.subject | achromatic number | en |
| dc.subject | interval graphs | en |
| dc.subject | permutation graphs | en |
| dc.subject | np-completeness | en |
| dc.subject | achromatic number | en |
| dc.subject | algorithm | en |
| dc.subject | cographs | en |
| dc.title | The harmonious coloring problem is NP-complete for interval and permutation graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.dam.2007.07.005 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2007 | - |
| heal.abstract | In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which G admits a harmonious coloring with k colors. Extending previous work on the NP-completeness of the harmonious coloring problem when restricted to the class of disconnected graphs which are simultaneously cographs and interval graphs, we prove that the problem is also NP-complete for connected interval and permutation graphs. (C) 2007 Elsevier B.V. All fights reserved. | en |
| heal.journalName | Discrete Applied Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Asdre-2007-The harmonious color.pdf | 196.47 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
