### 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 language | English |
---|---|

Pages (from-to) | 763-773 |

Number of pages | 11 |

Journal | European Journal of Operational Research |

Volume | 243 |

Issue number | 3 |

DOIs | |

Publication status | Published - 2015 Jan 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*European Journal of Operational Research*,

*243*(3), 763-773. https://doi.org/10.1016/j.ejor.2014.12.028

}

*European Journal of Operational Research*, vol. 243, no. 3, pp. 763-773. https://doi.org/10.1016/j.ejor.2014.12.028

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

Research output: Contribution to journal › Article

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 -