Inverse chromatic number problems in interval and permutation graphs

Yerim Chung, Jean François Culus, Marc Demange

Research output: Contribution to journalArticle

Abstract

Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we discuss diverse possible versions and then focus on two application frameworks which motivate this problem in interval and permutation graphs: the inverse booking problem and the inverse track assignment problem. The inverse booking problem is closely related to some previously known scheduling problems; we propose new hardness results and polynomial cases. The inverse track assignment problem motivates our study of the inverse chromatic number problem in permutation graphs; we show how to solve in polynomial time a generalization of the problem with a bounded number of colors.

Original languageEnglish
Pages (from-to)763-773
Number of pages11
JournalEuropean Journal of Operational Research
Volume243
Issue number3
DOIs
Publication statusPublished - 2015 Jan 1

Fingerprint

Permutation Graphs
Interval Graphs
Chromatic number
Inverse problems
Polynomials
Assignment Problem
Hardness
Scheduling
Color
Inverse Problem
Graph in graph theory
Scheduling Problem
Polynomial time
Graph
Polynomial
Integer

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Chung, Yerim ; Culus, Jean François ; Demange, Marc. / Inverse chromatic number problems in interval and permutation graphs. In: European Journal of Operational Research. 2015 ; Vol. 243, No. 3. pp. 763-773.
@article{b04fdb0b36e7461d955608f79909cd99,
title = "Inverse chromatic number problems in interval and permutation graphs",
abstract = "Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we discuss diverse possible versions and then focus on two application frameworks which motivate this problem in interval and permutation graphs: the inverse booking problem and the inverse track assignment problem. The inverse booking problem is closely related to some previously known scheduling problems; we propose new hardness results and polynomial cases. The inverse track assignment problem motivates our study of the inverse chromatic number problem in permutation graphs; we show how to solve in polynomial time a generalization of the problem with a bounded number of colors.",
author = "Yerim Chung and Culus, {Jean Fran{\cc}ois} and Marc Demange",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.ejor.2014.12.028",
language = "English",
volume = "243",
pages = "763--773",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

Inverse chromatic number problems in interval and permutation graphs. / Chung, Yerim; Culus, Jean François; Demange, Marc.

In: European Journal of Operational Research, Vol. 243, No. 3, 01.01.2015, p. 763-773.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Inverse chromatic number problems in interval and permutation graphs

AU - Chung, Yerim

AU - Culus, Jean François

AU - Demange, Marc

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we discuss diverse possible versions and then focus on two application frameworks which motivate this problem in interval and permutation graphs: the inverse booking problem and the inverse track assignment problem. The inverse booking problem is closely related to some previously known scheduling problems; we propose new hardness results and polynomial cases. The inverse track assignment problem motivates our study of the inverse chromatic number problem in permutation graphs; we show how to solve in polynomial time a generalization of the problem with a bounded number of colors.

AB - Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we discuss diverse possible versions and then focus on two application frameworks which motivate this problem in interval and permutation graphs: the inverse booking problem and the inverse track assignment problem. The inverse booking problem is closely related to some previously known scheduling problems; we propose new hardness results and polynomial cases. The inverse track assignment problem motivates our study of the inverse chromatic number problem in permutation graphs; we show how to solve in polynomial time a generalization of the problem with a bounded number of colors.

UR - http://www.scopus.com/inward/record.url?scp=84923641681&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923641681&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2014.12.028

DO - 10.1016/j.ejor.2014.12.028

M3 - Article

VL - 243

SP - 763

EP - 773

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -